Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cauappcvgprlemupu | GIF version |
Description: Lemma for cauappcvgpr 6760. 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 6463 | . . . . 5 ⊢ <Q ⊆ (Q × Q) | |
2 | 1 | brel 4392 | . . . 4 ⊢ (𝑠 <Q 𝑟 → (𝑠 ∈ Q ∧ 𝑟 ∈ Q)) |
3 | 2 | simprd 107 | . . 3 ⊢ (𝑠 <Q 𝑟 → 𝑟 ∈ Q) |
4 | 3 | 3ad2ant2 926 | . 2 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → 𝑟 ∈ Q) |
5 | breq2 3768 | . . . . . . 7 ⊢ (𝑢 = 𝑠 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠)) | |
6 | 5 | rexbidv 2327 | . . . . . 6 ⊢ (𝑢 = 𝑠 → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠)) |
7 | cauappcvgpr.lim | . . . . . . . 8 ⊢ 𝐿 = 〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉 | |
8 | 7 | fveq2i 5181 | . . . . . . 7 ⊢ (2nd ‘𝐿) = (2nd ‘〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉) |
9 | nqex 6461 | . . . . . . . . 9 ⊢ Q ∈ V | |
10 | 9 | rabex 3901 | . . . . . . . 8 ⊢ {𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)} ∈ V |
11 | 9 | rabex 3901 | . . . . . . . 8 ⊢ {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} ∈ V |
12 | 10, 11 | op2nd 5774 | . . . . . . 7 ⊢ (2nd ‘〈{𝑙 ∈ Q ∣ ∃𝑞 ∈ Q (𝑙 +Q 𝑞) <Q (𝐹‘𝑞)}, {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢}〉) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} |
13 | 8, 12 | eqtri 2060 | . . . . . 6 ⊢ (2nd ‘𝐿) = {𝑢 ∈ Q ∣ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢} |
14 | 6, 13 | elrab2 2700 | . . . . 5 ⊢ (𝑠 ∈ (2nd ‘𝐿) ↔ (𝑠 ∈ Q ∧ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠)) |
15 | 14 | simprbi 260 | . . . 4 ⊢ (𝑠 ∈ (2nd ‘𝐿) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠) |
16 | 15 | 3ad2ant3 927 | . . 3 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠) |
17 | ltsonq 6496 | . . . . . . 7 ⊢ <Q Or Q | |
18 | 17, 1 | sotri 4720 | . . . . . 6 ⊢ ((((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 ∧ 𝑠 <Q 𝑟) → ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟) |
19 | 18 | expcom 109 | . . . . 5 ⊢ (𝑠 <Q 𝑟 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 → ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
20 | 19 | 3ad2ant2 926 | . . . 4 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 → ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
21 | 20 | reximdv 2420 | . . 3 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑠 → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
22 | 16, 21 | mpd 13 | . 2 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟) |
23 | breq2 3768 | . . . 4 ⊢ (𝑢 = 𝑟 → (((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) | |
24 | 23 | rexbidv 2327 | . . 3 ⊢ (𝑢 = 𝑟 → (∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑢 ↔ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
25 | 24, 13 | elrab2 2700 | . 2 ⊢ (𝑟 ∈ (2nd ‘𝐿) ↔ (𝑟 ∈ Q ∧ ∃𝑞 ∈ Q ((𝐹‘𝑞) +Q 𝑞) <Q 𝑟)) |
26 | 4, 22, 25 | sylanbrc 394 | 1 ⊢ ((𝜑 ∧ 𝑠 <Q 𝑟 ∧ 𝑠 ∈ (2nd ‘𝐿)) → 𝑟 ∈ (2nd ‘𝐿)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ∧ w3a 885 = wceq 1243 ∈ wcel 1393 ∀wral 2306 ∃wrex 2307 {crab 2310 〈cop 3378 class class class wbr 3764 ⟶wf 4898 ‘cfv 4902 (class class class)co 5512 2nd c2nd 5766 Qcnq 6378 +Q cplq 6380 <Q cltq 6383 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-eprel 4026 df-id 4030 df-po 4033 df-iso 4034 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-irdg 5957 df-oadd 6005 df-omul 6006 df-er 6106 df-ec 6108 df-qs 6112 df-ni 6402 df-mi 6404 df-lti 6405 df-enq 6445 df-nqqs 6446 df-ltnqqs 6451 |
This theorem is referenced by: cauappcvgprlemrnd 6748 |
Copyright terms: Public domain | W3C validator |