| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 0elnn | GIF version | ||
| Description: A natural number is either the empty set or has the empty set as an element. (Contributed by Jim Kingdon, 23-Aug-2019.) |
| Ref | Expression |
|---|---|
| 0elnn | ⊢ (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2238 | . . 3 ⊢ (𝑥 = ∅ → (𝑥 = ∅ ↔ ∅ = ∅)) | |
| 2 | eleq2 2295 | . . 3 ⊢ (𝑥 = ∅ → (∅ ∈ 𝑥 ↔ ∅ ∈ ∅)) | |
| 3 | 1, 2 | orbi12d 801 | . 2 ⊢ (𝑥 = ∅ → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (∅ = ∅ ∨ ∅ ∈ ∅))) |
| 4 | eqeq1 2238 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 = ∅ ↔ 𝑦 = ∅)) | |
| 5 | eleq2 2295 | . . 3 ⊢ (𝑥 = 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝑦)) | |
| 6 | 4, 5 | orbi12d 801 | . 2 ⊢ (𝑥 = 𝑦 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (𝑦 = ∅ ∨ ∅ ∈ 𝑦))) |
| 7 | eqeq1 2238 | . . 3 ⊢ (𝑥 = suc 𝑦 → (𝑥 = ∅ ↔ suc 𝑦 = ∅)) | |
| 8 | eleq2 2295 | . . 3 ⊢ (𝑥 = suc 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ suc 𝑦)) | |
| 9 | 7, 8 | orbi12d 801 | . 2 ⊢ (𝑥 = suc 𝑦 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦))) |
| 10 | eqeq1 2238 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 = ∅ ↔ 𝐴 = ∅)) | |
| 11 | eleq2 2295 | . . 3 ⊢ (𝑥 = 𝐴 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝐴)) | |
| 12 | 10, 11 | orbi12d 801 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (𝐴 = ∅ ∨ ∅ ∈ 𝐴))) |
| 13 | eqid 2231 | . . 3 ⊢ ∅ = ∅ | |
| 14 | 13 | orci 739 | . 2 ⊢ (∅ = ∅ ∨ ∅ ∈ ∅) |
| 15 | 0ex 4221 | . . . . . . 7 ⊢ ∅ ∈ V | |
| 16 | 15 | sucid 4520 | . . . . . 6 ⊢ ∅ ∈ suc ∅ |
| 17 | suceq 4505 | . . . . . 6 ⊢ (𝑦 = ∅ → suc 𝑦 = suc ∅) | |
| 18 | 16, 17 | eleqtrrid 2321 | . . . . 5 ⊢ (𝑦 = ∅ → ∅ ∈ suc 𝑦) |
| 19 | 18 | a1i 9 | . . . 4 ⊢ (𝑦 ∈ ω → (𝑦 = ∅ → ∅ ∈ suc 𝑦)) |
| 20 | sssucid 4518 | . . . . . 6 ⊢ 𝑦 ⊆ suc 𝑦 | |
| 21 | 20 | a1i 9 | . . . . 5 ⊢ (𝑦 ∈ ω → 𝑦 ⊆ suc 𝑦) |
| 22 | 21 | sseld 3227 | . . . 4 ⊢ (𝑦 ∈ ω → (∅ ∈ 𝑦 → ∅ ∈ suc 𝑦)) |
| 23 | 19, 22 | jaod 725 | . . 3 ⊢ (𝑦 ∈ ω → ((𝑦 = ∅ ∨ ∅ ∈ 𝑦) → ∅ ∈ suc 𝑦)) |
| 24 | olc 719 | . . 3 ⊢ (∅ ∈ suc 𝑦 → (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦)) | |
| 25 | 23, 24 | syl6 33 | . 2 ⊢ (𝑦 ∈ ω → ((𝑦 = ∅ ∨ ∅ ∈ 𝑦) → (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦))) |
| 26 | 3, 6, 9, 12, 14, 25 | finds 4704 | 1 ⊢ (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 716 = wceq 1398 ∈ wcel 2202 ⊆ wss 3201 ∅c0 3496 suc csuc 4468 ωcom 4694 |
| 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-iinf 4692 |
| This theorem depends on definitions: df-bi 117 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-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-suc 4474 df-iom 4695 |
| This theorem is referenced by: nn0eln0 4724 nnsucsssuc 6703 nntri3or 6704 nnm00 6741 ssfilem 7105 ssfilemd 7107 diffitest 7119 fiintim 7166 enumct 7357 nnnninfeq 7370 elni2 7577 enq0tr 7697 bj-charfunr 16509 |
| Copyright terms: Public domain | W3C validator |