Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bj-nnelirr GIF version

Theorem bj-nnelirr 16274
Description: A natural number does not belong to itself. Version of elirr 4632 for natural numbers, which does not require ax-setind 4628. (Contributed by BJ, 24-Nov-2019.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-nnelirr (𝐴 ∈ ω → ¬ 𝐴𝐴)

Proof of Theorem bj-nnelirr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 noel 3495 . 2 ¬ ∅ ∈ ∅
2 df-suc 4461 . . . . . 6 suc 𝑦 = (𝑦 ∪ {𝑦})
32eleq2i 2296 . . . . 5 (suc 𝑦 ∈ suc 𝑦 ↔ suc 𝑦 ∈ (𝑦 ∪ {𝑦}))
4 elun 3345 . . . . . 6 (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) ↔ (suc 𝑦𝑦 ∨ suc 𝑦 ∈ {𝑦}))
5 bj-nntrans 16272 . . . . . . . 8 (𝑦 ∈ ω → (suc 𝑦𝑦 → suc 𝑦𝑦))
6 sucssel 4514 . . . . . . . 8 (𝑦 ∈ ω → (suc 𝑦𝑦𝑦𝑦))
75, 6syld 45 . . . . . . 7 (𝑦 ∈ ω → (suc 𝑦𝑦𝑦𝑦))
8 vex 2802 . . . . . . . . . 10 𝑦 ∈ V
98sucid 4507 . . . . . . . . 9 𝑦 ∈ suc 𝑦
10 elsni 3684 . . . . . . . . 9 (suc 𝑦 ∈ {𝑦} → suc 𝑦 = 𝑦)
119, 10eleqtrid 2318 . . . . . . . 8 (suc 𝑦 ∈ {𝑦} → 𝑦𝑦)
1211a1i 9 . . . . . . 7 (𝑦 ∈ ω → (suc 𝑦 ∈ {𝑦} → 𝑦𝑦))
137, 12jaod 722 . . . . . 6 (𝑦 ∈ ω → ((suc 𝑦𝑦 ∨ suc 𝑦 ∈ {𝑦}) → 𝑦𝑦))
144, 13biimtrid 152 . . . . 5 (𝑦 ∈ ω → (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) → 𝑦𝑦))
153, 14biimtrid 152 . . . 4 (𝑦 ∈ ω → (suc 𝑦 ∈ suc 𝑦𝑦𝑦))
1615con3d 634 . . 3 (𝑦 ∈ ω → (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦))
1716rgen 2583 . 2 𝑦 ∈ ω (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)
18 ax-bdel 16142 . . . 4 BOUNDED 𝑥𝑥
1918ax-bdn 16138 . . 3 BOUNDED ¬ 𝑥𝑥
20 nfv 1574 . . 3 𝑥 ¬ ∅ ∈ ∅
21 nfv 1574 . . 3 𝑥 ¬ 𝑦𝑦
22 nfv 1574 . . 3 𝑥 ¬ suc 𝑦 ∈ suc 𝑦
23 eleq1 2292 . . . . . 6 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ∈ 𝑥))
24 eleq2 2293 . . . . . 6 (𝑥 = ∅ → (∅ ∈ 𝑥 ↔ ∅ ∈ ∅))
2523, 24bitrd 188 . . . . 5 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ∈ ∅))
2625notbid 671 . . . 4 (𝑥 = ∅ → (¬ 𝑥𝑥 ↔ ¬ ∅ ∈ ∅))
2726biimprd 158 . . 3 (𝑥 = ∅ → (¬ ∅ ∈ ∅ → ¬ 𝑥𝑥))
28 elequ1 2204 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑥))
29 elequ2 2205 . . . . . 6 (𝑥 = 𝑦 → (𝑦𝑥𝑦𝑦))
3028, 29bitrd 188 . . . . 5 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
3130notbid 671 . . . 4 (𝑥 = 𝑦 → (¬ 𝑥𝑥 ↔ ¬ 𝑦𝑦))
3231biimpd 144 . . 3 (𝑥 = 𝑦 → (¬ 𝑥𝑥 → ¬ 𝑦𝑦))
33 eleq1 2292 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦𝑥))
34 eleq2 2293 . . . . . 6 (𝑥 = suc 𝑦 → (suc 𝑦𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
3533, 34bitrd 188 . . . . 5 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
3635notbid 671 . . . 4 (𝑥 = suc 𝑦 → (¬ 𝑥𝑥 ↔ ¬ suc 𝑦 ∈ suc 𝑦))
3736biimprd 158 . . 3 (𝑥 = suc 𝑦 → (¬ suc 𝑦 ∈ suc 𝑦 → ¬ 𝑥𝑥))
38 nfcv 2372 . . 3 𝑥𝐴
39 nfv 1574 . . 3 𝑥 ¬ 𝐴𝐴
40 eleq1 2292 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝑥))
41 eleq2 2293 . . . . . 6 (𝑥 = 𝐴 → (𝐴𝑥𝐴𝐴))
4240, 41bitrd 188 . . . . 5 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝐴))
4342notbid 671 . . . 4 (𝑥 = 𝐴 → (¬ 𝑥𝑥 ↔ ¬ 𝐴𝐴))
4443biimpd 144 . . 3 (𝑥 = 𝐴 → (¬ 𝑥𝑥 → ¬ 𝐴𝐴))
4519, 20, 21, 22, 27, 32, 37, 38, 39, 44bj-bdfindisg 16269 . 2 ((¬ ∅ ∈ ∅ ∧ ∀𝑦 ∈ ω (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)) → (𝐴 ∈ ω → ¬ 𝐴𝐴))
461, 17, 45mp2an 426 1 (𝐴 ∈ ω → ¬ 𝐴𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wo 713   = wceq 1395  wcel 2200  wral 2508  cun 3195  wss 3197  c0 3491  {csn 3666  suc csuc 4455  ωcom 4681
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-nul 4209  ax-pr 4292  ax-un 4523  ax-bd0 16134  ax-bdor 16137  ax-bdn 16138  ax-bdal 16139  ax-bdex 16140  ax-bdeq 16141  ax-bdel 16142  ax-bdsb 16143  ax-bdsep 16205  ax-infvn 16262
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-sn 3672  df-pr 3673  df-uni 3888  df-int 3923  df-suc 4461  df-iom 4682  df-bdc 16162  df-bj-ind 16248
This theorem is referenced by:  bj-nnen2lp  16275
  Copyright terms: Public domain W3C validator