| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cauappcvgprlemcl | GIF version | ||
| Description: Lemma for cauappcvgpr 7973. The putative limit is a positive real. (Contributed by Jim Kingdon, 20-Jun-2020.) |
| Ref | Expression |
|---|---|
| cauappcvgpr.f | ⊢ (𝜑 → 𝐹:Q⟶Q) |
| cauappcvgpr.app | ⊢ (𝜑 → ∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞)))) |
| cauappcvgpr.bnd | ⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝)) |
| cauappcvgpr.lim | ⊢ 𝐿 = 〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉 |
| Ref | Expression |
|---|---|
| cauappcvgprlemcl | ⊢ (𝜑 → 𝐿 ∈ P) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cauappcvgpr.f | . . . 4 ⊢ (𝜑 → 𝐹:Q⟶Q) | |
| 2 | cauappcvgpr.app | . . . 4 ⊢ (𝜑 → ∀𝑝 ∈ Q ∀𝑞 ∈ Q ((𝐹‘𝑝) <Q ((𝐹‘𝑞) +Q (𝑝 +Q 𝑞)) ∧ (𝐹‘𝑞) <Q ((𝐹‘𝑝) +Q (𝑝 +Q 𝑞)))) | |
| 3 | cauappcvgpr.bnd | . . . 4 ⊢ (𝜑 → ∀𝑝 ∈ Q 𝐴 <Q (𝐹‘𝑝)) | |
| 4 | cauappcvgpr.lim | . . . 4 ⊢ 𝐿 = 〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉 | |
| 5 | 1, 2, 3, 4 | cauappcvgprlemm 7956 | . . 3 ⊢ (𝜑 → (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))) |
| 6 | ssrab2 3322 | . . . . . 6 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ⊆ Q | |
| 7 | nqex 7674 | . . . . . . 7 ⊢ Q ∈ V | |
| 8 | 7 | elpw2 4268 | . . . . . 6 ⊢ ({𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ 𝒫 Q ↔ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ⊆ Q) |
| 9 | 6, 8 | mpbir 146 | . . . . 5 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ 𝒫 Q |
| 10 | ssrab2 3322 | . . . . . 6 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ⊆ Q | |
| 11 | 7 | elpw2 4268 | . . . . . 6 ⊢ ({𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ 𝒫 Q ↔ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ⊆ Q) |
| 12 | 10, 11 | mpbir 146 | . . . . 5 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ 𝒫 Q |
| 13 | opelxpi 4780 | . . . . 5 ⊢ (({𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ 𝒫 Q ∧ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ 𝒫 Q) → 〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉 ∈ (𝒫 Q × 𝒫 Q)) | |
| 14 | 9, 12, 13 | mp2an 426 | . . . 4 ⊢ 〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉 ∈ (𝒫 Q × 𝒫 Q) |
| 15 | 4, 14 | eqeltri 2305 | . . 3 ⊢ 𝐿 ∈ (𝒫 Q × 𝒫 Q) |
| 16 | 5, 15 | jctil 312 | . 2 ⊢ (𝜑 → (𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿)))) |
| 17 | 1, 2, 3, 4 | cauappcvgprlemrnd 7961 | . . 3 ⊢ (𝜑 → (∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿))))) |
| 18 | 1, 2, 3, 4 | cauappcvgprlemdisj 7962 | . . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿))) |
| 19 | 1, 2, 3, 4 | cauappcvgprlemloc 7963 | . . 3 ⊢ (𝜑 → ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿)))) |
| 20 | 17, 18, 19 | 3jca 1204 | . 2 ⊢ (𝜑 → ((∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))) ∧ ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)) ∧ ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿))))) |
| 21 | elnp1st2nd 7787 | . 2 ⊢ (𝐿 ∈ P ↔ ((𝐿 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝐿) ∧ ∃𝑟 ∈ Q 𝑟 ∈ (2nd ‘𝐿))) ∧ ((∀𝑠 ∈ Q (𝑠 ∈ (1st ‘𝐿) ↔ ∃𝑟 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑟 ∈ (1st ‘𝐿))) ∧ ∀𝑟 ∈ Q (𝑟 ∈ (2nd ‘𝐿) ↔ ∃𝑠 ∈ Q (𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)))) ∧ ∀𝑠 ∈ Q ¬ (𝑠 ∈ (1st ‘𝐿) ∧ 𝑠 ∈ (2nd ‘𝐿)) ∧ ∀𝑠 ∈ Q ∀𝑟 ∈ Q (𝑠 <Q 𝑟 → (𝑠 ∈ (1st ‘𝐿) ∨ 𝑟 ∈ (2nd ‘𝐿)))))) | |
| 22 | 16, 20, 21 | sylanbrc 417 | 1 ⊢ (𝜑 → 𝐿 ∈ P) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ∀wral 2520 ∃wrex 2521 {crab 2524 ⊆ wss 3210 𝒫 cpw 3668 〈cop 3691 class class class wbr 4108 × cxp 4746 ⟶wf 5347 ‘cfv 5351 (class class class)co 6049 1st c1st 6331 2nd c2nd 6332 Qcnq 7591 +Q cplq 7593 <Q cltq 7596 Pcnp 7602 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4224 ax-sep 4227 ax-nul 4235 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-setind 4658 ax-iinf 4709 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-dif 3212 df-un 3214 df-in 3216 df-ss 3223 df-nul 3508 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-iun 3992 df-br 4109 df-opab 4171 df-mpt 4172 df-tr 4208 df-eprel 4409 df-id 4413 df-po 4416 df-iso 4417 df-iord 4486 df-on 4488 df-suc 4491 df-iom 4712 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-f 5355 df-f1 5356 df-fo 5357 df-f1o 5358 df-fv 5359 df-ov 6052 df-oprab 6053 df-mpo 6054 df-1st 6333 df-2nd 6334 df-recs 6535 df-irdg 6600 df-1o 6646 df-oadd 6650 df-omul 6651 df-er 6766 df-ec 6768 df-qs 6772 df-ni 7615 df-pli 7616 df-mi 7617 df-lti 7618 df-plpq 7655 df-mpq 7656 df-enq 7658 df-nqqs 7659 df-plqqs 7660 df-mqqs 7661 df-1nqqs 7662 df-rq 7663 df-ltnqqs 7664 df-inp 7777 |
| This theorem is referenced by: cauappcvgprlemladdfu 7965 cauappcvgprlemladdfl 7966 cauappcvgprlemladdru 7967 cauappcvgprlemladdrl 7968 cauappcvgprlemladd 7969 cauappcvgprlem1 7970 cauappcvgprlem2 7971 cauappcvgpr 7973 |
| Copyright terms: Public domain | W3C validator |