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

Theorem bj-nnelirr 16893
Description: A natural number does not belong to itself. Version of elirr 4683 for natural numbers, which does not require ax-setind 4679. (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 3525 . 2 ¬ ∅ ∈ ∅
2 df-suc 4511 . . . . . 6 suc 𝑦 = (𝑦 ∪ {𝑦})
32eleq2i 2305 . . . . 5 (suc 𝑦 ∈ suc 𝑦 ↔ suc 𝑦 ∈ (𝑦 ∪ {𝑦}))
4 elun 3370 . . . . . 6 (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) ↔ (suc 𝑦𝑦 ∨ suc 𝑦 ∈ {𝑦}))
5 bj-nntrans 16891 . . . . . . . 8 (𝑦 ∈ ω → (suc 𝑦𝑦 → suc 𝑦𝑦))
6 sucssel 4564 . . . . . . . 8 (𝑦 ∈ ω → (suc 𝑦𝑦𝑦𝑦))
75, 6syld 45 . . . . . . 7 (𝑦 ∈ ω → (suc 𝑦𝑦𝑦𝑦))
8 vex 2824 . . . . . . . . . 10 𝑦 ∈ V
98sucid 4557 . . . . . . . . 9 𝑦 ∈ suc 𝑦
10 elsni 3723 . . . . . . . . 9 (suc 𝑦 ∈ {𝑦} → suc 𝑦 = 𝑦)
119, 10eleqtrid 2327 . . . . . . . 8 (suc 𝑦 ∈ {𝑦} → 𝑦𝑦)
1211a1i 9 . . . . . . 7 (𝑦 ∈ ω → (suc 𝑦 ∈ {𝑦} → 𝑦𝑦))
137, 12jaod 729 . . . . . 6 (𝑦 ∈ ω → ((suc 𝑦𝑦 ∨ suc 𝑦 ∈ {𝑦}) → 𝑦𝑦))
144, 13biimtrid 152 . . . . 5 (𝑦 ∈ ω → (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) → 𝑦𝑦))
153, 14biimtrid 152 . . . 4 (𝑦 ∈ ω → (suc 𝑦 ∈ suc 𝑦𝑦𝑦))
1615con3d 640 . . 3 (𝑦 ∈ ω → (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦))
1716rgen 2603 . 2 𝑦 ∈ ω (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)
18 ax-bdel 16761 . . . 4 BOUNDED 𝑥𝑥
1918ax-bdn 16757 . . 3 BOUNDED ¬ 𝑥𝑥
20 nfv 1581 . . 3 𝑥 ¬ ∅ ∈ ∅
21 nfv 1581 . . 3 𝑥 ¬ 𝑦𝑦
22 nfv 1581 . . 3 𝑥 ¬ suc 𝑦 ∈ suc 𝑦
23 eleq1 2301 . . . . . 6 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ∈ 𝑥))
24 eleq2 2302 . . . . . 6 (𝑥 = ∅ → (∅ ∈ 𝑥 ↔ ∅ ∈ ∅))
2523, 24bitrd 188 . . . . 5 (𝑥 = ∅ → (𝑥𝑥 ↔ ∅ ∈ ∅))
2625notbid 677 . . . 4 (𝑥 = ∅ → (¬ 𝑥𝑥 ↔ ¬ ∅ ∈ ∅))
2726biimprd 158 . . 3 (𝑥 = ∅ → (¬ ∅ ∈ ∅ → ¬ 𝑥𝑥))
28 elequ1 2213 . . . . . 6 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑥))
29 elequ2 2214 . . . . . 6 (𝑥 = 𝑦 → (𝑦𝑥𝑦𝑦))
3028, 29bitrd 188 . . . . 5 (𝑥 = 𝑦 → (𝑥𝑥𝑦𝑦))
3130notbid 677 . . . 4 (𝑥 = 𝑦 → (¬ 𝑥𝑥 ↔ ¬ 𝑦𝑦))
3231biimpd 144 . . 3 (𝑥 = 𝑦 → (¬ 𝑥𝑥 → ¬ 𝑦𝑦))
33 eleq1 2301 . . . . . 6 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦𝑥))
34 eleq2 2302 . . . . . 6 (𝑥 = suc 𝑦 → (suc 𝑦𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
3533, 34bitrd 188 . . . . 5 (𝑥 = suc 𝑦 → (𝑥𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
3635notbid 677 . . . 4 (𝑥 = suc 𝑦 → (¬ 𝑥𝑥 ↔ ¬ suc 𝑦 ∈ suc 𝑦))
3736biimprd 158 . . 3 (𝑥 = suc 𝑦 → (¬ suc 𝑦 ∈ suc 𝑦 → ¬ 𝑥𝑥))
38 nfcv 2392 . . 3 𝑥𝐴
39 nfv 1581 . . 3 𝑥 ¬ 𝐴𝐴
40 eleq1 2301 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝑥))
41 eleq2 2302 . . . . . 6 (𝑥 = 𝐴 → (𝐴𝑥𝐴𝐴))
4240, 41bitrd 188 . . . . 5 (𝑥 = 𝐴 → (𝑥𝑥𝐴𝐴))
4342notbid 677 . . . 4 (𝑥 = 𝐴 → (¬ 𝑥𝑥 ↔ ¬ 𝐴𝐴))
4443biimpd 144 . . 3 (𝑥 = 𝐴 → (¬ 𝑥𝑥 → ¬ 𝐴𝐴))
4519, 20, 21, 22, 27, 32, 37, 38, 39, 44bj-bdfindisg 16888 . 2 ((¬ ∅ ∈ ∅ ∧ ∀𝑦 ∈ ω (¬ 𝑦𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)) → (𝐴 ∈ ω → ¬ 𝐴𝐴))
461, 17, 45mp2an 430 1 (𝐴 ∈ ω → ¬ 𝐴𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wo 720   = wceq 1402  wcel 2209  wral 2528  cun 3218  wss 3220  c0 3520  {csn 3705  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-13 2211  ax-14 2212  ax-ext 2220  ax-nul 4254  ax-pr 4341  ax-un 4573  ax-bd0 16753  ax-bdor 16756  ax-bdn 16757  ax-bdal 16758  ax-bdex 16759  ax-bdeq 16760  ax-bdel 16761  ax-bdsb 16762  ax-bdsep 16824  ax-infvn 16881
This theorem depends on definitions:  df-bi 117  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-rab 2537  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-sn 3711  df-pr 3712  df-uni 3931  df-int 3966  df-suc 4511  df-iom 4733  df-bdc 16781  df-bj-ind 16867
This theorem is referenced by:  bj-nnen2lp  16894
  Copyright terms: Public domain W3C validator