| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 3nsssucpw1 | GIF version | ||
| Description: Negated excluded middle implies that 3o is not a subset of the successor of the power set of 1o. (Contributed by James E. Hanson and Jim Kingdon, 31-Jul-2024.) |
| Ref | Expression |
|---|---|
| 3nsssucpw1 | ⊢ (¬ EXMID → ¬ 3o ⊆ suc 𝒫 1o) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-3o 6583 | . . . . . 6 ⊢ 3o = suc 2o | |
| 2 | 1 | sseq1i 3253 | . . . . 5 ⊢ (3o ⊆ suc 𝒫 1o ↔ suc 2o ⊆ suc 𝒫 1o) |
| 3 | 1lt2o 6609 | . . . . . . . . 9 ⊢ 1o ∈ 2o | |
| 4 | ssnel 4667 | . . . . . . . . 9 ⊢ (2o ⊆ 1o → ¬ 1o ∈ 2o) | |
| 5 | 3, 4 | mt2 645 | . . . . . . . 8 ⊢ ¬ 2o ⊆ 1o |
| 6 | 2onn 6688 | . . . . . . . . . 10 ⊢ 2o ∈ ω | |
| 7 | 6 | elexi 2815 | . . . . . . . . 9 ⊢ 2o ∈ V |
| 8 | 7 | elpw 3658 | . . . . . . . 8 ⊢ (2o ∈ 𝒫 1o ↔ 2o ⊆ 1o) |
| 9 | 5, 8 | mtbir 677 | . . . . . . 7 ⊢ ¬ 2o ∈ 𝒫 1o |
| 10 | 9 | a1i 9 | . . . . . 6 ⊢ (suc 2o ⊆ suc 𝒫 1o → ¬ 2o ∈ 𝒫 1o) |
| 11 | sucssel 4521 | . . . . . . . . 9 ⊢ (2o ∈ ω → (suc 2o ⊆ suc 𝒫 1o → 2o ∈ suc 𝒫 1o)) | |
| 12 | 6, 11 | ax-mp 5 | . . . . . . . 8 ⊢ (suc 2o ⊆ suc 𝒫 1o → 2o ∈ suc 𝒫 1o) |
| 13 | elsuci 4500 | . . . . . . . 8 ⊢ (2o ∈ suc 𝒫 1o → (2o ∈ 𝒫 1o ∨ 2o = 𝒫 1o)) | |
| 14 | 12, 13 | syl 14 | . . . . . . 7 ⊢ (suc 2o ⊆ suc 𝒫 1o → (2o ∈ 𝒫 1o ∨ 2o = 𝒫 1o)) |
| 15 | 14 | orcomd 736 | . . . . . 6 ⊢ (suc 2o ⊆ suc 𝒫 1o → (2o = 𝒫 1o ∨ 2o ∈ 𝒫 1o)) |
| 16 | 10, 15 | ecased 1385 | . . . . 5 ⊢ (suc 2o ⊆ suc 𝒫 1o → 2o = 𝒫 1o) |
| 17 | 2, 16 | sylbi 121 | . . . 4 ⊢ (3o ⊆ suc 𝒫 1o → 2o = 𝒫 1o) |
| 18 | 17 | eqcomd 2237 | . . 3 ⊢ (3o ⊆ suc 𝒫 1o → 𝒫 1o = 2o) |
| 19 | exmidpweq 7100 | . . 3 ⊢ (EXMID ↔ 𝒫 1o = 2o) | |
| 20 | 18, 19 | sylibr 134 | . 2 ⊢ (3o ⊆ suc 𝒫 1o → EXMID) |
| 21 | 20 | con3i 637 | 1 ⊢ (¬ EXMID → ¬ 3o ⊆ suc 𝒫 1o) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∨ wo 715 = wceq 1397 ∈ wcel 2202 ⊆ wss 3200 𝒫 cpw 3652 EXMIDwem 4284 suc csuc 4462 ωcom 4688 1oc1o 6574 2oc2o 6575 3oc3o 6576 |
| 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-nul 4215 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3an 1006 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-ral 2515 df-rex 2516 df-v 2804 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-pw 3654 df-sn 3675 df-pr 3676 df-uni 3894 df-int 3929 df-tr 4188 df-exmid 4285 df-iord 4463 df-on 4465 df-suc 4468 df-iom 4689 df-1o 6581 df-2o 6582 df-3o 6583 |
| This theorem is referenced by: onntri45 7458 |
| Copyright terms: Public domain | W3C validator |