ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  0elnn GIF version

Theorem 0elnn 4746
Description: A natural number is either the empty set or has the empty set as an element. (Contributed by Jim Kingdon, 23-Aug-2019.)
Assertion
Ref Expression
0elnn (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴))

Proof of Theorem 0elnn
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqeq1 2241 . . 3 (𝑥 = ∅ → (𝑥 = ∅ ↔ ∅ = ∅))
2 eleq2 2298 . . 3 (𝑥 = ∅ → (∅ ∈ 𝑥 ↔ ∅ ∈ ∅))
31, 2orbi12d 801 . 2 (𝑥 = ∅ → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (∅ = ∅ ∨ ∅ ∈ ∅)))
4 eqeq1 2241 . . 3 (𝑥 = 𝑦 → (𝑥 = ∅ ↔ 𝑦 = ∅))
5 eleq2 2298 . . 3 (𝑥 = 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝑦))
64, 5orbi12d 801 . 2 (𝑥 = 𝑦 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (𝑦 = ∅ ∨ ∅ ∈ 𝑦)))
7 eqeq1 2241 . . 3 (𝑥 = suc 𝑦 → (𝑥 = ∅ ↔ suc 𝑦 = ∅))
8 eleq2 2298 . . 3 (𝑥 = suc 𝑦 → (∅ ∈ 𝑥 ↔ ∅ ∈ suc 𝑦))
97, 8orbi12d 801 . 2 (𝑥 = suc 𝑦 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦)))
10 eqeq1 2241 . . 3 (𝑥 = 𝐴 → (𝑥 = ∅ ↔ 𝐴 = ∅))
11 eleq2 2298 . . 3 (𝑥 = 𝐴 → (∅ ∈ 𝑥 ↔ ∅ ∈ 𝐴))
1210, 11orbi12d 801 . 2 (𝑥 = 𝐴 → ((𝑥 = ∅ ∨ ∅ ∈ 𝑥) ↔ (𝐴 = ∅ ∨ ∅ ∈ 𝐴)))
13 eqid 2234 . . 3 ∅ = ∅
1413orci 739 . 2 (∅ = ∅ ∨ ∅ ∈ ∅)
15 0ex 4242 . . . . . . 7 ∅ ∈ V
1615sucid 4543 . . . . . 6 ∅ ∈ suc ∅
17 suceq 4528 . . . . . 6 (𝑦 = ∅ → suc 𝑦 = suc ∅)
1816, 17eleqtrrid 2324 . . . . 5 (𝑦 = ∅ → ∅ ∈ suc 𝑦)
1918a1i 9 . . . 4 (𝑦 ∈ ω → (𝑦 = ∅ → ∅ ∈ suc 𝑦))
20 sssucid 4541 . . . . . 6 𝑦 ⊆ suc 𝑦
2120a1i 9 . . . . 5 (𝑦 ∈ ω → 𝑦 ⊆ suc 𝑦)
2221sseld 3241 . . . 4 (𝑦 ∈ ω → (∅ ∈ 𝑦 → ∅ ∈ suc 𝑦))
2319, 22jaod 725 . . 3 (𝑦 ∈ ω → ((𝑦 = ∅ ∨ ∅ ∈ 𝑦) → ∅ ∈ suc 𝑦))
24 olc 719 . . 3 (∅ ∈ suc 𝑦 → (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦))
2523, 24syl6 33 . 2 (𝑦 ∈ ω → ((𝑦 = ∅ ∨ ∅ ∈ 𝑦) → (suc 𝑦 = ∅ ∨ ∅ ∈ suc 𝑦)))
263, 6, 9, 12, 14, 25finds 4727 1 (𝐴 ∈ ω → (𝐴 = ∅ ∨ ∅ ∈ 𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wo 716   = wceq 1398  wcel 2205  wss 3214  c0 3512  suc csuc 4491  ωcom 4717
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-iinf 4715
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-uni 3920  df-int 3955  df-suc 4497  df-iom 4718
This theorem is referenced by:  nn0eln0  4747  nnsucsssuc  6738  nntri3or  6739  nnm00  6776  ssfilem  7143  ssfilemd  7145  diffitest  7157  fiintim  7204  enumct  7419  nnnninfeq  7432  elni2  7645  enq0tr  7765  bj-charfunr  16706
  Copyright terms: Public domain W3C validator