| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dedekindicclemeu | GIF version | ||
| Description: Lemma for dedekindicc 15220. Part of proving uniqueness. (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 | ⊢ (𝜑 → 𝐴 < 𝐵) |
| dedekindicclemeu.are | ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) |
| dedekindicclemeu.ac | ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐶 ∧ ∀𝑟 ∈ 𝑈 𝐶 < 𝑟)) |
| dedekindicclemeu.bre | ⊢ (𝜑 → 𝐷 ∈ (𝐴[,]𝐵)) |
| dedekindicclemeu.bc | ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐷 ∧ ∀𝑟 ∈ 𝑈 𝐷 < 𝑟)) |
| dedekindicclemeu.lt | ⊢ (𝜑 → 𝐶 < 𝐷) |
| Ref | Expression |
|---|---|
| dedekindicclemeu | ⊢ (𝜑 → ⊥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4062 | . . . 4 ⊢ (𝑞 = 𝐶 → (𝑞 < 𝐶 ↔ 𝐶 < 𝐶)) | |
| 2 | dedekindicclemeu.ac | . . . . . 6 ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐶 ∧ ∀𝑟 ∈ 𝑈 𝐶 < 𝑟)) | |
| 3 | 2 | simpld 112 | . . . . 5 ⊢ (𝜑 → ∀𝑞 ∈ 𝐿 𝑞 < 𝐶) |
| 4 | 3 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐿) → ∀𝑞 ∈ 𝐿 𝑞 < 𝐶) |
| 5 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐿) → 𝐶 ∈ 𝐿) | |
| 6 | 1, 4, 5 | rspcdva 2889 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐿) → 𝐶 < 𝐶) |
| 7 | dedekindicc.a | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 8 | dedekindicc.b | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 9 | iccssre 10112 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
| 10 | 7, 8, 9 | syl2anc 411 | . . . . . 6 ⊢ (𝜑 → (𝐴[,]𝐵) ⊆ ℝ) |
| 11 | dedekindicclemeu.are | . . . . . 6 ⊢ (𝜑 → 𝐶 ∈ (𝐴[,]𝐵)) | |
| 12 | 10, 11 | sseldd 3202 | . . . . 5 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 13 | 12 | ltnrd 8219 | . . . 4 ⊢ (𝜑 → ¬ 𝐶 < 𝐶) |
| 14 | 13 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐿) → ¬ 𝐶 < 𝐶) |
| 15 | 6, 14 | pm2.21fal 1393 | . 2 ⊢ ((𝜑 ∧ 𝐶 ∈ 𝐿) → ⊥) |
| 16 | breq2 4063 | . . . 4 ⊢ (𝑟 = 𝐷 → (𝐷 < 𝑟 ↔ 𝐷 < 𝐷)) | |
| 17 | dedekindicclemeu.bc | . . . . . 6 ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐷 ∧ ∀𝑟 ∈ 𝑈 𝐷 < 𝑟)) | |
| 18 | 17 | simprd 114 | . . . . 5 ⊢ (𝜑 → ∀𝑟 ∈ 𝑈 𝐷 < 𝑟) |
| 19 | 18 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑈) → ∀𝑟 ∈ 𝑈 𝐷 < 𝑟) |
| 20 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑈) → 𝐷 ∈ 𝑈) | |
| 21 | 16, 19, 20 | rspcdva 2889 | . . 3 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑈) → 𝐷 < 𝐷) |
| 22 | dedekindicclemeu.bre | . . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (𝐴[,]𝐵)) | |
| 23 | 10, 22 | sseldd 3202 | . . . . 5 ⊢ (𝜑 → 𝐷 ∈ ℝ) |
| 24 | 23 | ltnrd 8219 | . . . 4 ⊢ (𝜑 → ¬ 𝐷 < 𝐷) |
| 25 | 24 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑈) → ¬ 𝐷 < 𝐷) |
| 26 | 21, 25 | pm2.21fal 1393 | . 2 ⊢ ((𝜑 ∧ 𝐷 ∈ 𝑈) → ⊥) |
| 27 | dedekindicclemeu.lt | . . 3 ⊢ (𝜑 → 𝐶 < 𝐷) | |
| 28 | breq2 4063 | . . . . 5 ⊢ (𝑟 = 𝐷 → (𝐶 < 𝑟 ↔ 𝐶 < 𝐷)) | |
| 29 | eleq1 2270 | . . . . . 6 ⊢ (𝑟 = 𝐷 → (𝑟 ∈ 𝑈 ↔ 𝐷 ∈ 𝑈)) | |
| 30 | 29 | orbi2d 792 | . . . . 5 ⊢ (𝑟 = 𝐷 → ((𝐶 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈) ↔ (𝐶 ∈ 𝐿 ∨ 𝐷 ∈ 𝑈))) |
| 31 | 28, 30 | imbi12d 234 | . . . 4 ⊢ (𝑟 = 𝐷 → ((𝐶 < 𝑟 → (𝐶 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)) ↔ (𝐶 < 𝐷 → (𝐶 ∈ 𝐿 ∨ 𝐷 ∈ 𝑈)))) |
| 32 | breq1 4062 | . . . . . . 7 ⊢ (𝑞 = 𝐶 → (𝑞 < 𝑟 ↔ 𝐶 < 𝑟)) | |
| 33 | eleq1 2270 | . . . . . . . 8 ⊢ (𝑞 = 𝐶 → (𝑞 ∈ 𝐿 ↔ 𝐶 ∈ 𝐿)) | |
| 34 | 33 | orbi1d 793 | . . . . . . 7 ⊢ (𝑞 = 𝐶 → ((𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈) ↔ (𝐶 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) |
| 35 | 32, 34 | imbi12d 234 | . . . . . 6 ⊢ (𝑞 = 𝐶 → ((𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)) ↔ (𝐶 < 𝑟 → (𝐶 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)))) |
| 36 | 35 | ralbidv 2508 | . . . . 5 ⊢ (𝑞 = 𝐶 → (∀𝑟 ∈ (𝐴[,]𝐵)(𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)) ↔ ∀𝑟 ∈ (𝐴[,]𝐵)(𝐶 < 𝑟 → (𝐶 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)))) |
| 37 | dedekindicc.loc | . . . . 5 ⊢ (𝜑 → ∀𝑞 ∈ (𝐴[,]𝐵)∀𝑟 ∈ (𝐴[,]𝐵)(𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) | |
| 38 | 36, 37, 11 | rspcdva 2889 | . . . 4 ⊢ (𝜑 → ∀𝑟 ∈ (𝐴[,]𝐵)(𝐶 < 𝑟 → (𝐶 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) |
| 39 | 31, 38, 22 | rspcdva 2889 | . . 3 ⊢ (𝜑 → (𝐶 < 𝐷 → (𝐶 ∈ 𝐿 ∨ 𝐷 ∈ 𝑈))) |
| 40 | 27, 39 | mpd 13 | . 2 ⊢ (𝜑 → (𝐶 ∈ 𝐿 ∨ 𝐷 ∈ 𝑈)) |
| 41 | 15, 26, 40 | mpjaodan 800 | 1 ⊢ (𝜑 → ⊥) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 710 = wceq 1373 ⊥wfal 1378 ∈ wcel 2178 ∀wral 2486 ∃wrex 2487 ∩ cin 3173 ⊆ wss 3174 ∅c0 3468 class class class wbr 4059 (class class class)co 5967 ℝcr 7959 < clt 8142 [,]cicc 10048 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-cnex 8051 ax-resscn 8052 ax-pre-ltirr 8072 ax-pre-ltwlin 8073 ax-pre-lttrn 8074 |
| This theorem depends on definitions: df-bi 117 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-nel 2474 df-ral 2491 df-rex 2492 df-rab 2495 df-v 2778 df-sbc 3006 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-br 4060 df-opab 4122 df-id 4358 df-po 4361 df-iso 4362 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-iota 5251 df-fun 5292 df-fv 5298 df-ov 5970 df-oprab 5971 df-mpo 5972 df-pnf 8144 df-mnf 8145 df-xr 8146 df-ltxr 8147 df-le 8148 df-icc 10052 |
| This theorem is referenced by: dedekindicclemicc 15219 |
| Copyright terms: Public domain | W3C validator |