| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cauappcvgprlemupu | GIF version | ||
| Description: Lemma for cauappcvgpr 7925. The upper cut of the putative limit is upper. (Contributed by Jim Kingdon, 4-Aug-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 |
|---|---|
| cauappcvgprlemupu | ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → 𝑟 ∈ (2nd ‘𝐿)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltrelnq 7628 | . . . . 5 ⊢ <Q ⊆ (Q × Q) | |
| 2 | 1 | brel 4784 | . . . 4 ⊢ (𝑠 <Q 𝑟 → (𝑠 ∈ Q ∧ 𝑟 ∈ Q)) |
| 3 | 2 | simprd 114 | . . 3 ⊢ (𝑠 <Q 𝑟 → 𝑟 ∈ Q) |
| 4 | 3 | 3ad2ant2 1046 | . 2 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → 𝑟 ∈ Q) |
| 5 | breq2 4097 | . . . . . . 7 ⊢ (𝑢 = 𝑠 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠)) | |
| 6 | 5 | rexbidv 2534 | . . . . . 6 ⊢ (𝑢 = 𝑠 → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠)) |
| 7 | cauappcvgpr.lim | . . . . . . . 8 ⊢ 𝐿 = 〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉 | |
| 8 | 7 | fveq2i 5651 | . . . . . . 7 ⊢ (2nd ‘𝐿) = (2nd ‘〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉) |
| 9 | nqex 7626 | . . . . . . . . 9 ⊢ Q ∈ V | |
| 10 | 9 | rabex 4239 | . . . . . . . 8 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ V |
| 11 | 9 | rabex 4239 | . . . . . . . 8 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ V |
| 12 | 10, 11 | op2nd 6319 | . . . . . . 7 ⊢ (2nd ‘〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} |
| 13 | 8, 12 | eqtri 2252 | . . . . . 6 ⊢ (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} |
| 14 | 6, 13 | elrab2 2966 | . . . . 5 ⊢ (𝑠 ∈ (2nd ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠)) |
| 15 | 14 | simprbi 275 | . . . 4 ⊢ (𝑠 ∈ (2nd ‘𝐿) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠) |
| 16 | 15 | 3ad2ant3 1047 | . . 3 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠) |
| 17 | ltsonq 7661 | . . . . . . 7 ⊢ <Q Or Q | |
| 18 | 17, 1 | sotri 5139 | . . . . . 6 ⊢ ((((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 ∧ 𝑠 <Q 𝑟) → ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟) |
| 19 | 18 | expcom 116 | . . . . 5 ⊢ (𝑠 <Q 𝑟 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 → ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
| 20 | 19 | 3ad2ant2 1046 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 → ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
| 21 | 20 | reximdv 2634 | . . 3 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
| 22 | 16, 21 | mpd 13 | . 2 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟) |
| 23 | breq2 4097 | . . . 4 ⊢ (𝑢 = 𝑟 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) | |
| 24 | 23 | rexbidv 2534 | . . 3 ⊢ (𝑢 = 𝑟 → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
| 25 | 24, 13 | elrab2 2966 | . 2 ⊢ (𝑟 ∈ (2nd ‘𝐿) ↔ (𝑟 ∈ Q ∧ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
| 26 | 4, 22, 25 | sylanbrc 417 | 1 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → 𝑟 ∈ (2nd ‘𝐿)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ∀wral 2511 ∃wrex 2512 {crab 2515 〈cop 3676 class class class wbr 4093 ⟶wf 5329 ‘cfv 5333 (class class class)co 6028 2nd c2nd 6311 Qcnq 7543 +Q cplq 7545 <Q cltq 7548 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-iinf 4692 |
| 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 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-reu 2518 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-tr 4193 df-eprel 4392 df-id 4396 df-po 4399 df-iso 4400 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-recs 6514 df-irdg 6579 df-oadd 6629 df-omul 6630 df-er 6745 df-ec 6747 df-qs 6751 df-ni 7567 df-mi 7569 df-lti 7570 df-enq 7610 df-nqqs 7611 df-ltnqqs 7616 |
| This theorem is referenced by: cauappcvgprlemrnd 7913 |
| Copyright terms: Public domain | W3C validator |