| 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 6627 | . . . . . 6 ⊢ 3o = suc 2o | |
| 2 | 1 | sseq1i 3254 | . . . . 5 ⊢ (3o ⊆ suc 𝒫 1o ↔ suc 2o ⊆ suc 𝒫 1o) |
| 3 | 1lt2o 6653 | . . . . . . . . 9 ⊢ 1o ∈ 2o | |
| 4 | ssnel 4673 | . . . . . . . . 9 ⊢ (2o ⊆ 1o → ¬ 1o ∈ 2o) | |
| 5 | 3, 4 | mt2 645 | . . . . . . . 8 ⊢ ¬ 2o ⊆ 1o |
| 6 | 2onn 6732 | . . . . . . . . . 10 ⊢ 2o ∈ ω | |
| 7 | 6 | elexi 2816 | . . . . . . . . 9 ⊢ 2o ∈ V |
| 8 | 7 | elpw 3662 | . . . . . . . 8 ⊢ (2o ∈ 𝒫 1o ↔ 2o ⊆ 1o) |
| 9 | 5, 8 | mtbir 678 | . . . . . . 7 ⊢ ¬ 2o ∈ 𝒫 1o |
| 10 | 9 | a1i 9 | . . . . . 6 ⊢ (suc 2o ⊆ suc 𝒫 1o → ¬ 2o ∈ 𝒫 1o) |
| 11 | sucssel 4527 | . . . . . . . . 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 4506 | . . . . . . . 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 737 | . . . . . 6 ⊢ (suc 2o ⊆ suc 𝒫 1o → (2o = 𝒫 1o ∨ 2o ∈ 𝒫 1o)) |
| 16 | 10, 15 | ecased 1386 | . . . . 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 7144 | . . 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 716 = wceq 1398 ∈ wcel 2202 ⊆ wss 3201 𝒫 cpw 3656 EXMIDwem 4290 suc csuc 4468 ωcom 4694 1oc1o 6618 2oc2o 6619 3oc3o 6620 |
| 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 2204 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-ral 2516 df-rex 2517 df-v 2805 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-uni 3899 df-int 3934 df-tr 4193 df-exmid 4291 df-iord 4469 df-on 4471 df-suc 4474 df-iom 4695 df-1o 6625 df-2o 6626 df-3o 6627 |
| This theorem is referenced by: onntri45 7502 |
| Copyright terms: Public domain | W3C validator |