| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dedekindeulemeu | GIF version | ||
| Description: Lemma for dedekindeu 15346. Part of proving uniqueness. (Contributed by Jim Kingdon, 31-Jan-2024.) |
| Ref | Expression |
|---|---|
| dedekindeu.lss | ⊢ (𝜑 → 𝐿 ⊆ ℝ) |
| dedekindeu.uss | ⊢ (𝜑 → 𝑈 ⊆ ℝ) |
| dedekindeu.lm | ⊢ (𝜑 → ∃𝑞 ∈ ℝ 𝑞 ∈ 𝐿) |
| dedekindeu.um | ⊢ (𝜑 → ∃𝑟 ∈ ℝ 𝑟 ∈ 𝑈) |
| dedekindeu.lr | ⊢ (𝜑 → ∀𝑞 ∈ ℝ (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ 𝐿 𝑞 < 𝑟)) |
| dedekindeu.ur | ⊢ (𝜑 → ∀𝑟 ∈ ℝ (𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ 𝑈 𝑞 < 𝑟)) |
| dedekindeu.disj | ⊢ (𝜑 → (𝐿 ∩ 𝑈) = ∅) |
| dedekindeu.loc | ⊢ (𝜑 → ∀𝑞 ∈ ℝ ∀𝑟 ∈ ℝ (𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) |
| dedekindeulemeu.are | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| dedekindeulemeu.ac | ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐴 ∧ ∀𝑟 ∈ 𝑈 𝐴 < 𝑟)) |
| dedekindeulemeu.bre | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
| dedekindeulemeu.bc | ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐵 ∧ ∀𝑟 ∈ 𝑈 𝐵 < 𝑟)) |
| dedekindeulemeu.lt | ⊢ (𝜑 → 𝐴 < 𝐵) |
| Ref | Expression |
|---|---|
| dedekindeulemeu | ⊢ (𝜑 → ⊥) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq1 4091 | . . . 4 ⊢ (𝑞 = 𝐴 → (𝑞 < 𝐴 ↔ 𝐴 < 𝐴)) | |
| 2 | dedekindeulemeu.ac | . . . . . 6 ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐴 ∧ ∀𝑟 ∈ 𝑈 𝐴 < 𝑟)) | |
| 3 | 2 | simpld 112 | . . . . 5 ⊢ (𝜑 → ∀𝑞 ∈ 𝐿 𝑞 < 𝐴) |
| 4 | 3 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝐿) → ∀𝑞 ∈ 𝐿 𝑞 < 𝐴) |
| 5 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝐿) → 𝐴 ∈ 𝐿) | |
| 6 | 1, 4, 5 | rspcdva 2915 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝐿) → 𝐴 < 𝐴) |
| 7 | dedekindeulemeu.are | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 8 | 7 | ltnrd 8290 | . . . 4 ⊢ (𝜑 → ¬ 𝐴 < 𝐴) |
| 9 | 8 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝐿) → ¬ 𝐴 < 𝐴) |
| 10 | 6, 9 | pm2.21fal 1417 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝐿) → ⊥) |
| 11 | breq2 4092 | . . . 4 ⊢ (𝑟 = 𝐵 → (𝐵 < 𝑟 ↔ 𝐵 < 𝐵)) | |
| 12 | dedekindeulemeu.bc | . . . . . 6 ⊢ (𝜑 → (∀𝑞 ∈ 𝐿 𝑞 < 𝐵 ∧ ∀𝑟 ∈ 𝑈 𝐵 < 𝑟)) | |
| 13 | 12 | simprd 114 | . . . . 5 ⊢ (𝜑 → ∀𝑟 ∈ 𝑈 𝐵 < 𝑟) |
| 14 | 13 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → ∀𝑟 ∈ 𝑈 𝐵 < 𝑟) |
| 15 | simpr 110 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐵 ∈ 𝑈) | |
| 16 | 11, 14, 15 | rspcdva 2915 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → 𝐵 < 𝐵) |
| 17 | dedekindeulemeu.bre | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 18 | 17 | ltnrd 8290 | . . . 4 ⊢ (𝜑 → ¬ 𝐵 < 𝐵) |
| 19 | 18 | adantr 276 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → ¬ 𝐵 < 𝐵) |
| 20 | 16, 19 | pm2.21fal 1417 | . 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝑈) → ⊥) |
| 21 | dedekindeulemeu.lt | . . 3 ⊢ (𝜑 → 𝐴 < 𝐵) | |
| 22 | breq2 4092 | . . . . 5 ⊢ (𝑟 = 𝐵 → (𝐴 < 𝑟 ↔ 𝐴 < 𝐵)) | |
| 23 | eleq1 2294 | . . . . . 6 ⊢ (𝑟 = 𝐵 → (𝑟 ∈ 𝑈 ↔ 𝐵 ∈ 𝑈)) | |
| 24 | 23 | orbi2d 797 | . . . . 5 ⊢ (𝑟 = 𝐵 → ((𝐴 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈) ↔ (𝐴 ∈ 𝐿 ∨ 𝐵 ∈ 𝑈))) |
| 25 | 22, 24 | imbi12d 234 | . . . 4 ⊢ (𝑟 = 𝐵 → ((𝐴 < 𝑟 → (𝐴 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)) ↔ (𝐴 < 𝐵 → (𝐴 ∈ 𝐿 ∨ 𝐵 ∈ 𝑈)))) |
| 26 | breq1 4091 | . . . . . . 7 ⊢ (𝑞 = 𝐴 → (𝑞 < 𝑟 ↔ 𝐴 < 𝑟)) | |
| 27 | eleq1 2294 | . . . . . . . 8 ⊢ (𝑞 = 𝐴 → (𝑞 ∈ 𝐿 ↔ 𝐴 ∈ 𝐿)) | |
| 28 | 27 | orbi1d 798 | . . . . . . 7 ⊢ (𝑞 = 𝐴 → ((𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈) ↔ (𝐴 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) |
| 29 | 26, 28 | imbi12d 234 | . . . . . 6 ⊢ (𝑞 = 𝐴 → ((𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)) ↔ (𝐴 < 𝑟 → (𝐴 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)))) |
| 30 | 29 | ralbidv 2532 | . . . . 5 ⊢ (𝑞 = 𝐴 → (∀𝑟 ∈ ℝ (𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)) ↔ ∀𝑟 ∈ ℝ (𝐴 < 𝑟 → (𝐴 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)))) |
| 31 | dedekindeu.loc | . . . . 5 ⊢ (𝜑 → ∀𝑞 ∈ ℝ ∀𝑟 ∈ ℝ (𝑞 < 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) | |
| 32 | 30, 31, 7 | rspcdva 2915 | . . . 4 ⊢ (𝜑 → ∀𝑟 ∈ ℝ (𝐴 < 𝑟 → (𝐴 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))) |
| 33 | 25, 32, 17 | rspcdva 2915 | . . 3 ⊢ (𝜑 → (𝐴 < 𝐵 → (𝐴 ∈ 𝐿 ∨ 𝐵 ∈ 𝑈))) |
| 34 | 21, 33 | mpd 13 | . 2 ⊢ (𝜑 → (𝐴 ∈ 𝐿 ∨ 𝐵 ∈ 𝑈)) |
| 35 | 10, 20, 34 | mpjaodan 805 | 1 ⊢ (𝜑 → ⊥) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 715 = wceq 1397 ⊥wfal 1402 ∈ wcel 2202 ∀wral 2510 ∃wrex 2511 ∩ cin 3199 ⊆ wss 3200 ∅c0 3494 class class class wbr 4088 ℝcr 8030 < clt 8213 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8122 ax-resscn 8123 ax-pre-ltirr 8143 |
| This theorem depends on definitions: df-bi 117 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-br 4089 df-opab 4151 df-xp 4731 df-pnf 8215 df-mnf 8216 df-ltxr 8218 |
| This theorem is referenced by: dedekindeu 15346 |
| Copyright terms: Public domain | W3C validator |