| 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 2245 | . . 3 ⊢ (𝑥 = ∅ → (𝑥 = ∅ ↔ ∅ = ∅)) | |
| 2 | eleq2 2302 | . . 3 ⊢ (𝑥 = ∅ → (∅ ∈ 𝑥 ↔ ∅ ∈ ∅)) | |
| 3 | 1, 2 | orbi12d 805 | . 2 ⊢ (𝑥 = ∅ → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (∅ = ∅ ∨ ∅ ∈ ∅))) |
| 4 | eqeq1 2245 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 = ∅ ↔ 𝑦 = ∅)) | |
| 5 | eleq2 2302 | . . 3 ⊢ (𝑥 = 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝑦)) | |
| 6 | 4, 5 | orbi12d 805 | . 2 ⊢ (𝑥 = 𝑦 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (𝑦 = ∅ ∨ ∅ ∈ 𝑦))) |
| 7 | eqeq1 2245 | . . 3 ⊢ (𝑥 = suc 𝑦 → (𝑥 = ∅ ↔ suc 𝑦 = ∅)) | |
| 8 | eleq2 2302 | . . 3 ⊢ (𝑥 = suc 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ suc 𝑦)) | |
| 9 | 7, 8 | orbi12d 805 | . 2 ⊢ (𝑥 = suc 𝑦 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦))) |
| 10 | eqeq1 2245 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 = ∅ ↔ 𝐴 = ∅)) | |
| 11 | eleq2 2302 | . . 3 ⊢ (𝑥 = 𝐴 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝐴)) | |
| 12 | 10, 11 | orbi12d 805 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (𝐴 = ∅ ∨ ∅ ∈ 𝐴))) |
| 13 | eqid 2238 | . . 3 ⊢ ∅ = ∅ | |
| 14 | 13 | orci 743 | . 2 ⊢ (∅ = ∅ ∨ ∅ ∈ ∅) |
| 15 | 0ex 4255 | . . . . . . 7 ⊢ ∅ ∈ V | |
| 16 | 15 | sucid 4557 | . . . . . 6 ⊢ ∅ ∈ suc ∅ |
| 17 | suceq 4542 | . . . . . 6 ⊢ (𝑦 = ∅ → suc 𝑦 = suc ∅) | |
| 18 | 16, 17 | eleqtrrid 2328 | . . . . 5 ⊢ (𝑦 = ∅ → ∅ ∈ suc 𝑦) |
| 19 | 18 | a1i 9 | . . . 4 ⊢ (𝑦 ∈ ω → (𝑦 = ∅ → ∅ ∈ suc 𝑦)) |
| 20 | sssucid 4555 | . . . . . 6 ⊢ 𝑦 ⊆ suc 𝑦 | |
| 21 | 20 | a1i 9 | . . . . 5 ⊢ (𝑦 ∈ ω → 𝑦 ⊆ suc 𝑦) |
| 22 | 21 | sseld 3247 | . . . 4 ⊢ (𝑦 ∈ ω → (∅ ∈ 𝑦 → ∅ ∈ suc 𝑦)) |
| 23 | 19, 22 | jaod 729 | . . 3 ⊢ (𝑦 ∈ ω → ((𝑦 = ∅ ∨ ∅ ∈ 𝑦) → ∅ ∈ suc 𝑦)) |
| 24 | olc 723 | . . 3 ⊢ (∅ ∈ suc 𝑦 → (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦)) | |
| 25 | 23, 24 | syl6 33 | . 2 ⊢ (𝑦 ∈ ω → ((𝑦 = ∅ ∨ ∅ ∈ 𝑦) → (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦))) |
| 26 | 3, 6, 9, 12, 14, 25 | finds 4742 | 1 ⊢ (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ wo 720 = wceq 1402 ∈ wcel 2209 ⊆ wss 3220 ∅c0 3520 suc csuc 4505 ωcom 4732 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-iinf 4730 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-uni 3931 df-int 3966 df-suc 4511 df-iom 4733 |
| This theorem is referenced by: nn0eln0 4762 nnsucsssuc 6755 nntri3or 6756 nnm00 6793 ssfilem 7167 ssfilemd 7169 diffitest 7181 fiintim 7228 enumct 7445 nnnninfeq 7458 elni2 7671 enq0tr 7791 bj-charfunr 16750 |
| Copyright terms: Public domain | W3C validator |