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

Theorem bj-nnelirr 13835
Description: A natural number does not belong to itself. Version of elirr 4518 for natural numbers, which does not require ax-setind 4514. (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 3413 . 2 ¬ ∅ ∈ ∅
2 df-suc 4349 . . . . . 6 suc 𝑦 = (𝑦 ∪ {𝑦})
32eleq2i 2233 . . . . 5 (suc 𝑦 ∈ suc 𝑦 ↔ suc 𝑦 ∈ (𝑦 ∪ {𝑦}))
4 elun 3263 . . . . . 6 (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) ↔ (suc 𝑦𝑦 ∨ suc 𝑦 ∈ {𝑦}))
5 bj-nntrans 13833 . . . . . . . 8 (𝑦 ∈ ω → (suc 𝑦𝑦 → suc 𝑦𝑦))
6 sucssel 4402 . . . . . . . 8 (𝑦 ∈ ω → (suc 𝑦𝑦𝑦𝑦))
75, 6syld 45 . . . . . . 7 (𝑦 ∈ ω → (suc 𝑦𝑦𝑦𝑦))
8 vex 2729 . . . . . . . . . 10 𝑦 ∈ V
98sucid 4395 . . . . . . . . 9 𝑦 ∈ suc 𝑦
10 elsni 3594 . . . . . . . . 9 (suc 𝑦 ∈ {𝑦} → suc 𝑦 = 𝑦)
119, 10eleqtrid 2255 . . . . . . . 8 (suc 𝑦 ∈ {𝑦} → 𝑦𝑦)
1211a1i 9 . . . . . . 7 (𝑦 ∈ ω → (suc 𝑦 ∈ {𝑦} → 𝑦𝑦))
137, 12jaod 707 . . . . . 6 (𝑦 ∈ ω → ((suc 𝑦𝑦 ∨ suc 𝑦 ∈ {𝑦}) → 𝑦𝑦))
144, 13syl5bi 151 . . . . 5 (𝑦 ∈ ω → (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) → 𝑦𝑦))
153, 14syl5bi 151 . . . 4 (𝑦 ∈ ω → (suc 𝑦 ∈ suc 𝑦𝑦𝑦))
1615con3d 621 . . 3 (𝑦 ∈ ω → (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦))
1716rgen 2519 . 2 𝑦 ∈ ω (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)
18 ax-bdel 13703 . . . 4 BOUNDED 𝑥𝑥
1918ax-bdn 13699 . . 3 BOUNDED ¬ 𝑥𝑥
20 nfv 1516 . . 3 𝑥 ¬ ∅ ∈ ∅
21 nfv 1516 . . 3 𝑥 ¬ 𝑦𝑦
22 nfv 1516 . . 3 𝑥 ¬ suc 𝑦 ∈ suc 𝑦
23 eleq1 2229 . . . . . 6 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ∈ 𝑥))
24 eleq2 2230 . . . . . 6 (𝑥 = ∅ → (∅ ∈ 𝑥 ↔ ∅ ∈ ∅))
2523, 24bitrd 187 . . . . 5 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ∈ ∅))
2625notbid 657 . . . 4 (𝑥 = ∅ → (¬ 𝑥𝑥 ↔ ¬ ∅ ∈ ∅))
2726biimprd 157 . . 3 (𝑥 = ∅ → (¬ ∅ ∈ ∅ → ¬ 𝑥𝑥))
28 elequ1 2140 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑥))
29 elequ2 2141 . . . . . 6 (𝑥 = 𝑦 → (𝑦𝑥𝑦𝑦))
3028, 29bitrd 187 . . . . 5 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
3130notbid 657 . . . 4 (𝑥 = 𝑦 → (¬ 𝑥𝑥 ↔ ¬ 𝑦𝑦))
3231biimpd 143 . . 3 (𝑥 = 𝑦 → (¬ 𝑥𝑥 → ¬ 𝑦𝑦))
33 eleq1 2229 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦𝑥))
34 eleq2 2230 . . . . . 6 (𝑥 = suc 𝑦 → (suc 𝑦𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
3533, 34bitrd 187 . . . . 5 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
3635notbid 657 . . . 4 (𝑥 = suc 𝑦 → (¬ 𝑥𝑥 ↔ ¬ suc 𝑦 ∈ suc 𝑦))
3736biimprd 157 . . 3 (𝑥 = suc 𝑦 → (¬ suc 𝑦 ∈ suc 𝑦 → ¬ 𝑥𝑥))
38 nfcv 2308 . . 3 𝑥𝐴
39 nfv 1516 . . 3 𝑥 ¬ 𝐴𝐴
40 eleq1 2229 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝑥))
41 eleq2 2230 . . . . . 6 (𝑥 = 𝐴 → (𝐴𝑥𝐴𝐴))
4240, 41bitrd 187 . . . . 5 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝐴))
4342notbid 657 . . . 4 (𝑥 = 𝐴 → (¬ 𝑥𝑥 ↔ ¬ 𝐴𝐴))
4443biimpd 143 . . 3 (𝑥 = 𝐴 → (¬ 𝑥𝑥 → ¬ 𝐴𝐴))
4519, 20, 21, 22, 27, 32, 37, 38, 39, 44bj-bdfindisg 13830 . 2 ((¬ ∅ ∈ ∅ ∧ ∀𝑦 ∈ ω (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)) → (𝐴 ∈ ω → ¬ 𝐴𝐴))
461, 17, 45mp2an 423 1 (𝐴 ∈ ω → ¬ 𝐴𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wo 698   = wceq 1343  wcel 2136  wral 2444  cun 3114  wss 3116  c0 3409  {csn 3576  suc csuc 4343  ωcom 4567
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-nul 4108  ax-pr 4187  ax-un 4411  ax-bd0 13695  ax-bdor 13698  ax-bdn 13699  ax-bdal 13700  ax-bdex 13701  ax-bdeq 13702  ax-bdel 13703  ax-bdsb 13704  ax-bdsep 13766  ax-infvn 13823
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-rab 2453  df-v 2728  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-sn 3582  df-pr 3583  df-uni 3790  df-int 3825  df-suc 4349  df-iom 4568  df-bdc 13723  df-bj-ind 13809
This theorem is referenced by:  bj-nnen2lp  13836
  Copyright terms: Public domain W3C validator