| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dedekindicclemlub | GIF version | ||
| Description: Lemma for dedekindicc 15498. The set L has a least upper bound. (Contributed by Jim Kingdon, 15-Feb-2024.) |
| Ref | Expression |
|---|---|
| dedekindicc.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| dedekindicc.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| dedekindicc.lss | ⊢ (𝜑 → 𝐿 ⊆ (𝐴[,]𝐵)) |
| dedekindicc.uss | ⊢ (𝜑 → 𝑈 ⊆ (𝐴[,]𝐵)) |
| dedekindicc.lm | ⊢ (𝜑 → ∃𝑞 ∈ (𝐴[,]𝐵)𝑞 ∈ 𝐿) |
| dedekindicc.um | ⊢ (𝜑 → ∃𝑟 ∈ (𝐴[,]𝐵)𝑟 ∈ 𝑈) |
| dedekindicc.lr | ⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)(𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)) |
| dedekindicc.ur | ⊢ (𝜑 → ∀𝑟 ∈ (𝐴[,]𝐵)(𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟)) |
| dedekindicc.disj | ⊢ (𝜑 → (𝐿 ∩ 𝑈) = ∅) |
| dedekindicc.loc | ⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)∀𝑟 ∈ (𝐴[,]𝐵)(𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) |
| dedekindicc.ab | ⊢ (𝜑 → 𝐴 < 𝐵) |
| Ref | Expression |
|---|---|
| dedekindicclemlub | ⊢ (𝜑 → ∃𝑥 ∈ (𝐴[,]𝐵)(∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dedekindicc.a | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 2 | dedekindicc.b | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 3 | dedekindicc.ab | . 2 ⊢ (𝜑 → 𝐴 < 𝐵) | |
| 4 | dedekindicc.lss | . 2 ⊢ (𝜑 → 𝐿 ⊆ (𝐴[,]𝐵)) | |
| 5 | dedekindicc.lm | . . 3 ⊢ (𝜑 → ∃𝑞 ∈ (𝐴[,]𝐵)𝑞 ∈ 𝐿) | |
| 6 | eleq1w 2293 | . . . . 5 ⊢ (𝑞 = 𝑥 → (𝑞 ∈ 𝐿 ↔ 𝑥 ∈ 𝐿)) | |
| 7 | 6 | cbvrexv 2779 | . . . 4 ⊢ (∃𝑞 ∈ (𝐴[,]𝐵)𝑞 ∈ 𝐿 ↔ ∃𝑥 ∈ (𝐴[,]𝐵)𝑥 ∈ 𝐿) |
| 8 | rexex 2588 | . . . 4 ⊢ (∃𝑥 ∈ (𝐴[,]𝐵)𝑥 ∈ 𝐿 → ∃𝑥 𝑥 ∈ 𝐿) | |
| 9 | 7, 8 | sylbi 121 | . . 3 ⊢ (∃𝑞 ∈ (𝐴[,]𝐵)𝑞 ∈ 𝐿 → ∃𝑥 𝑥 ∈ 𝐿) |
| 10 | 5, 9 | syl 14 | . 2 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐿) |
| 11 | dedekindicc.uss | . . 3 ⊢ (𝜑 → 𝑈 ⊆ (𝐴[,]𝐵)) | |
| 12 | dedekindicc.um | . . 3 ⊢ (𝜑 → ∃𝑟 ∈ (𝐴[,]𝐵)𝑟 ∈ 𝑈) | |
| 13 | dedekindicc.lr | . . 3 ⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)(𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)) | |
| 14 | dedekindicc.ur | . . 3 ⊢ (𝜑 → ∀𝑟 ∈ (𝐴[,]𝐵)(𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟)) | |
| 15 | dedekindicc.disj | . . 3 ⊢ (𝜑 → (𝐿 ∩ 𝑈) = ∅) | |
| 16 | dedekindicc.loc | . . 3 ⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)∀𝑟 ∈ (𝐴[,]𝐵)(𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) | |
| 17 | 1, 2, 4, 11, 5, 12, 13, 14, 15, 16 | dedekindicclemloc 15493 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ (𝐴[,]𝐵)∀𝑦 ∈ (𝐴[,]𝐵)(𝑥 < 𝑦 → (∃𝑧 ∈ 𝐿 𝑥 < 𝑧 ∨ ∀𝑧 ∈ 𝐿 𝑧 < 𝑦))) |
| 18 | 1, 2, 3, 4, 10, 17 | suplociccex 15490 | 1 ⊢ (𝜑 → ∃𝑥 ∈ (𝐴[,]𝐵)(∀𝑦 ∈ 𝐿 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ (𝐴[,]𝐵)(𝑦 < 𝑥 → ∃𝑧 ∈ 𝐿 𝑦 < 𝑧))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 = wceq 1398 ∃wex 1541 ∈ wcel 2203 ∀wral 2520 ∃wrex 2521 ∩ cin 3210 ⊆ wss 3211 ∅c0 3508 class class class wbr 4109 (class class class)co 6050 ℝcr 8126 < clt 8308 [,]cicc 10224 |
| 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 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 ax-cnex 8218 ax-resscn 8219 ax-1cn 8220 ax-1re 8221 ax-icn 8222 ax-addcl 8223 ax-addrcl 8224 ax-mulcl 8225 ax-mulrcl 8226 ax-addcom 8227 ax-mulcom 8228 ax-addass 8229 ax-mulass 8230 ax-distr 8231 ax-i2m1 8232 ax-0lt1 8233 ax-1rid 8234 ax-0id 8235 ax-rnegex 8236 ax-precex 8237 ax-cnre 8238 ax-pre-ltirr 8239 ax-pre-ltwlin 8240 ax-pre-lttrn 8241 ax-pre-apti 8242 ax-pre-ltadd 8243 ax-pre-mulgt0 8244 ax-pre-mulext 8245 ax-arch 8246 ax-caucvg 8247 ax-pre-suploc 8248 |
| 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-nel 2508 df-ral 2525 df-rex 2526 df-reu 2527 df-rmo 2528 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-if 3621 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-id 4414 df-po 4417 df-iso 4418 df-iord 4487 df-on 4489 df-ilim 4490 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-isom 5361 df-riota 6003 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-frec 6622 df-sup 7275 df-inf 7276 df-pnf 8310 df-mnf 8311 df-xr 8312 df-ltxr 8313 df-le 8314 df-sub 8446 df-neg 8447 df-reap 8849 df-ap 8856 df-div 8947 df-inn 9238 df-2 9296 df-3 9297 df-4 9298 df-n0 9497 df-z 9578 df-uz 9854 df-rp 9987 df-icc 10228 df-seqfrec 10810 df-exp 10901 df-cj 11527 df-re 11528 df-im 11529 df-rsqrt 11683 df-abs 11684 |
| This theorem is referenced by: dedekindicclemlu 15495 |
| Copyright terms: Public domain | W3C validator |