Theorem 0elnn 4768

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	|- ( A e. om -> ( A = (/) \/ (/) e. A ) )

Proof of Theorem 0elnn

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2245	. . 3 |- ( x = (/) -> ( x = (/) <-> (/) = (/) ) )
2		eleq2 2302	. . 3 |- ( x = (/) -> ( (/) e. x <-> (/) e. (/) ) )
3	1, 2	orbi12d 805	. 2 |- ( x = (/) -> ( ( x = (/) \/ (/) e. x ) <-> ( (/) = (/) \/ (/) e. (/) ) ) )
4		eqeq1 2245	. . 3 |- ( x = y -> ( x = (/) <-> y = (/) ) )
5		eleq2 2302	. . 3 |- ( x = y -> ( (/) e. x <-> (/) e. y ) )
6	4, 5	orbi12d 805	. 2 |- ( x = y -> ( ( x = (/) \/ (/) e. x ) <-> ( y = (/) \/ (/) e. y ) ) )
7		eqeq1 2245	. . 3 |- ( x = suc y -> ( x = (/) <-> suc y = (/) ) )
8		eleq2 2302	. . 3 |- ( x = suc y -> ( (/) e. x <-> (/) e. suc y ) )
9	7, 8	orbi12d 805	. 2 |- ( x = suc y -> ( ( x = (/) \/ (/) e. x ) <-> ( suc y = (/) \/ (/) e. suc y ) ) )
10		eqeq1 2245	. . 3 |- ( x = A -> ( x = (/) <-> A = (/) ) )
11		eleq2 2302	. . 3 |- ( x = A -> ( (/) e. x <-> (/) e. A ) )
12	10, 11	orbi12d 805	. 2 |- ( x = A -> ( ( x = (/) \/ (/) e. x ) <-> ( A = (/) \/ (/) e. A ) ) )
13		eqid 2238	. . 3 |- (/) = (/)
14	13	orci 743	. 2 |- ( (/) = (/) \/ (/) e. (/) )
15		0ex 4262	. . . . . . 7 |- (/) e. _V
16	15	sucid 4564	. . . . . 6 |- (/) e. suc (/)
17		suceq 4549	. . . . . 6 |- ( y = (/) -> suc y = suc (/) )
18	16, 17	eleqtrrid 2328	. . . . 5 |- ( y = (/) -> (/) e. suc y )
19	18	a1i 9	. . . 4 |- ( y e. om -> ( y = (/) -> (/) e. suc y ) )
20		sssucid 4562	. . . . . 6 |- y C_ suc y
21	20	a1i 9	. . . . 5 |- ( y e. om -> y C_ suc y )
22	21	sseld 3247	. . . 4 |- ( y e. om -> ( (/) e. y -> (/) e. suc y ) )
23	19, 22	jaod 729	. . 3 |- ( y e. om -> ( ( y = (/) \/ (/) e. y ) -> (/) e. suc y ) )
24		olc 723	. . 3 |- ( (/) e. suc y -> ( suc y = (/) \/ (/) e. suc y ) )
25	23, 24	syl6 33	. 2 |- ( y e. om -> ( ( y = (/) \/ (/) e. y ) -> ( suc y = (/) \/ (/) e. suc y ) ) )
26	3, 6, 9, 12, 14, 25	finds 4749	1 |- ( A e. om -> ( A = (/) \/ (/) e. A ) )

This proof depends on syntax axioms:   -> wi 4   \/ wo 720   = wceq 1402   e. wcel 2209   C_ wss 3220   (/)c0 3520   suc csuc 4512   omcom 4739

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-14 2212  ax-ext 2220  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-3an 1011  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-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-uni 3936  df-int 3971  df-suc 4518  df-iom 4740

This theorem is used by:  nn0eln0  4769  nnsucsssuc  6769  nntri3or  6770  nnm00  6807  ssfilem  7181  ssfilemd  7183  diffitest  7195  fiintim  7242  enumct  7461  nnnninfeq  7474  elni2  7687  enq0tr  7807  bj-charfunr  17041