Theorem bj-nnelirr 17145

Description: A natural number does not belong to itself. Version of elirr 4688 for natural numbers, which does not require ax-setind 4684. (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.

Step	Hyp	Ref	Expression
1		noel 3525	. 2 ⊢ ¬ ∅ ∈ ∅
2		df-suc 4516	. . . . . 6 ⊢ suc 𝑦 = (𝑦 ∪ {𝑦})
3	2	eleq2i 2305	. . . . 5 ⊢ (suc 𝑦 ∈ suc 𝑦 ↔ suc 𝑦 ∈ (𝑦 ∪ {𝑦}))
4		elun 3370	. . . . . 6 ⊢ (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) ↔ (suc 𝑦 ∈ 𝑦 ∨ suc 𝑦 ∈ {𝑦}))
5		bj-nntrans 17143	. . . . . . . 8 ⊢ (𝑦 ∈ ω → (suc 𝑦 ∈ 𝑦 → suc 𝑦 ⊆ 𝑦))
6		sucssel 4569	. . . . . . . 8 ⊢ (𝑦 ∈ ω → (suc 𝑦 ⊆ 𝑦 → 𝑦 ∈ 𝑦))
7	5, 6	syld 45	. . . . . . 7 ⊢ (𝑦 ∈ ω → (suc 𝑦 ∈ 𝑦 → 𝑦 ∈ 𝑦))
8		vex 2824	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
9	8	sucid 4562	. . . . . . . . 9 ⊢ 𝑦 ∈ suc 𝑦
10		elsni 3727	. . . . . . . . 9 ⊢ (suc 𝑦 ∈ {𝑦} → suc 𝑦 = 𝑦)
11	9, 10	eleqtrid 2327	. . . . . . . 8 ⊢ (suc 𝑦 ∈ {𝑦} → 𝑦 ∈ 𝑦)
12	11	a1i 9	. . . . . . 7 ⊢ (𝑦 ∈ ω → (suc 𝑦 ∈ {𝑦} → 𝑦 ∈ 𝑦))
13	7, 12	jaod 729	. . . . . 6 ⊢ (𝑦 ∈ ω → ((suc 𝑦 ∈ 𝑦 ∨ suc 𝑦 ∈ {𝑦}) → 𝑦 ∈ 𝑦))
14	4, 13	biimtrid 152	. . . . 5 ⊢ (𝑦 ∈ ω → (suc 𝑦 ∈ (𝑦 ∪ {𝑦}) → 𝑦 ∈ 𝑦))
15	3, 14	biimtrid 152	. . . 4 ⊢ (𝑦 ∈ ω → (suc 𝑦 ∈ suc 𝑦 → 𝑦 ∈ 𝑦))
16	15	con3d 640	. . 3 ⊢ (𝑦 ∈ ω → (¬ 𝑦 ∈ 𝑦 → ¬ suc 𝑦 ∈ suc 𝑦))
17	16	rgen 2603	. 2 ⊢ ∀𝑦 ∈ ω (¬ 𝑦 ∈ 𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)
18		ax-bdel 17013	. . . 4 ⊢ BOUNDED 𝑥 ∈ 𝑥
19	18	ax-bdn 17009	. . 3 ⊢ BOUNDED ¬ 𝑥 ∈ 𝑥
20		nfv 1581	. . 3 ⊢ Ⅎ𝑥 ¬ ∅ ∈ ∅
21		nfv 1581	. . 3 ⊢ Ⅎ𝑥 ¬ 𝑦 ∈ 𝑦
22		nfv 1581	. . 3 ⊢ Ⅎ𝑥 ¬ suc 𝑦 ∈ suc 𝑦
23		eleq1 2301	. . . . . 6 ⊢ (𝑥 = ∅ → (𝑥 ∈ 𝑥 ↔ ∅ ∈ 𝑥))
24		eleq2 2302	. . . . . 6 ⊢ (𝑥 = ∅ → (∅ ∈ 𝑥 ↔ ∅ ∈ ∅))
25	23, 24	bitrd 188	. . . . 5 ⊢ (𝑥 = ∅ → (𝑥 ∈ 𝑥 ↔ ∅ ∈ ∅))
26	25	notbid 677	. . . 4 ⊢ (𝑥 = ∅ → (¬ 𝑥 ∈ 𝑥 ↔ ¬ ∅ ∈ ∅))
27	26	biimprd 158	. . 3 ⊢ (𝑥 = ∅ → (¬ ∅ ∈ ∅ → ¬ 𝑥 ∈ 𝑥))
28		elequ1 2213	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑥))
29		elequ2 2214	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
30	28, 29	bitrd 188	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑥 ↔ 𝑦 ∈ 𝑦))
31	30	notbid 677	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝑦 ∈ 𝑦))
32	31	biimpd 144	. . 3 ⊢ (𝑥 = 𝑦 → (¬ 𝑥 ∈ 𝑥 → ¬ 𝑦 ∈ 𝑦))
33		eleq1 2301	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (𝑥 ∈ 𝑥 ↔ suc 𝑦 ∈ 𝑥))
34		eleq2 2302	. . . . . 6 ⊢ (𝑥 = suc 𝑦 → (suc 𝑦 ∈ 𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
35	33, 34	bitrd 188	. . . . 5 ⊢ (𝑥 = suc 𝑦 → (𝑥 ∈ 𝑥 ↔ suc 𝑦 ∈ suc 𝑦))
36	35	notbid 677	. . . 4 ⊢ (𝑥 = suc 𝑦 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ suc 𝑦 ∈ suc 𝑦))
37	36	biimprd 158	. . 3 ⊢ (𝑥 = suc 𝑦 → (¬ suc 𝑦 ∈ suc 𝑦 → ¬ 𝑥 ∈ 𝑥))
38		nfcv 2392	. . 3 ⊢ Ⅎ𝑥𝐴
39		nfv 1581	. . 3 ⊢ Ⅎ𝑥 ¬ 𝐴 ∈ 𝐴
40		eleq1 2301	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑥 ↔ 𝐴 ∈ 𝑥))
41		eleq2 2302	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝐴))
42	40, 41	bitrd 188	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑥 ↔ 𝐴 ∈ 𝐴))
43	42	notbid 677	. . . 4 ⊢ (𝑥 = 𝐴 → (¬ 𝑥 ∈ 𝑥 ↔ ¬ 𝐴 ∈ 𝐴))
44	43	biimpd 144	. . 3 ⊢ (𝑥 = 𝐴 → (¬ 𝑥 ∈ 𝑥 → ¬ 𝐴 ∈ 𝐴))
45	19, 20, 21, 22, 27, 32, 37, 38, 39, 44	bj-bdfindisg 17140	. 2 ⊢ ((¬ ∅ ∈ ∅ ∧ ∀𝑦 ∈ ω (¬ 𝑦 ∈ 𝑦 → ¬ suc 𝑦 ∈ suc 𝑦)) → (𝐴 ∈ ω → ¬ 𝐴 ∈ 𝐴))
46	1, 17, 45	mp2an 430	1 ⊢ (𝐴 ∈ ω → ¬ 𝐴 ∈ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∨ wo 720   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ∪ cun 3218   ⊆ wss 3220  ∅c0 3520  {csn 3709  suc csuc 4510  ωcom 4737

This proof depends on 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 4259  ax-pr 4346  ax-un 4578  ax-bd0 17005  ax-bdor 17008  ax-bdn 17009  ax-bdal 17010  ax-bdex 17011  ax-bdeq 17012  ax-bdel 17013  ax-bdsb 17014  ax-bdsep 17076  ax-infvn 17133

This proof 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 3715  df-pr 3716  df-uni 3936  df-int 3971  df-suc 4516  df-iom 4738  df-bdc 17033  df-bj-ind 17119

This theorem is used by:  bj-nnen2lp  17146