Theorem nn0suc 4700

Description: A natural number is either 0 or a successor. Similar theorems for arbitrary sets or real numbers will not be provable (without the law of the excluded middle), but equality of natural numbers is decidable. (Contributed by NM, 27-May-1998.)

Assertion

Ref	Expression
nn0suc	|- ( A e. om -> ( A = (/) \/ E. x e. om A = suc x ) )

Distinct variable group:   x, A

Proof of Theorem nn0suc

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

Step	Hyp	Ref	Expression
1		eqeq1 2236	. . 3 |- ( y = (/) -> ( y = (/) <-> (/) = (/) ) )
2		eqeq1 2236	. . . 4 |- ( y = (/) -> ( y = suc x <-> (/) = suc x ) )
3	2	rexbidv 2531	. . 3 |- ( y = (/) -> ( E. x e. om y = suc x <-> E. x e. om (/) = suc x ) )
4	1, 3	orbi12d 798	. 2 |- ( y = (/) -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( (/) = (/) \/ E. x e. om (/) = suc x ) ) )
5		eqeq1 2236	. . 3 |- ( y = z -> ( y = (/) <-> z = (/) ) )
6		eqeq1 2236	. . . 4 |- ( y = z -> ( y = suc x <-> z = suc x ) )
7	6	rexbidv 2531	. . 3 |- ( y = z -> ( E. x e. om y = suc x <-> E. x e. om z = suc x ) )
8	5, 7	orbi12d 798	. 2 |- ( y = z -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( z = (/) \/ E. x e. om z = suc x ) ) )
9		eqeq1 2236	. . 3 |- ( y = suc z -> ( y = (/) <-> suc z = (/) ) )
10		eqeq1 2236	. . . 4 |- ( y = suc z -> ( y = suc x <-> suc z = suc x ) )
11	10	rexbidv 2531	. . 3 |- ( y = suc z -> ( E. x e. om y = suc x <-> E. x e. om suc z = suc x ) )
12	9, 11	orbi12d 798	. 2 |- ( y = suc z -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( suc z = (/) \/ E. x e. om suc z = suc x ) ) )
13		eqeq1 2236	. . 3 |- ( y = A -> ( y = (/) <-> A = (/) ) )
14		eqeq1 2236	. . . 4 |- ( y = A -> ( y = suc x <-> A = suc x ) )
15	14	rexbidv 2531	. . 3 |- ( y = A -> ( E. x e. om y = suc x <-> E. x e. om A = suc x ) )
16	13, 15	orbi12d 798	. 2 |- ( y = A -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( A = (/) \/ E. x e. om A = suc x ) ) )
17		eqid 2229	. . 3 |- (/) = (/)
18	17	orci 736	. 2 |- ( (/) = (/) \/ E. x e. om (/) = suc x )
19		eqid 2229	. . . . 5 |- suc z = suc z
20		suceq 4497	. . . . . . 7 |- ( x = z -> suc x = suc z )
21	20	eqeq2d 2241	. . . . . 6 |- ( x = z -> ( suc z = suc x <-> suc z = suc z ) )
22	21	rspcev 2908	. . . . 5 |- ( ( z e. om /\ suc z = suc z ) -> E. x e. om suc z = suc x )
23	19, 22	mpan2 425	. . . 4 |- ( z e. om -> E. x e. om suc z = suc x )
24	23	olcd 739	. . 3 |- ( z e. om -> ( suc z = (/) \/ E. x e. om suc z = suc x ) )
25	24	a1d 22	. 2 |- ( z e. om -> ( ( z = (/) \/ E. x e. om z = suc x ) -> ( suc z = (/) \/ E. x e. om suc z = suc x ) ) )
26	4, 8, 12, 16, 18, 25	finds 4696	1 |- ( A e. om -> ( A = (/) \/ E. x e. om A = suc x ) )

Syntax hints:   -> wi 4   \/ wo 713   = wceq 1395   e. wcel 2200   E.wrex 2509   (/)c0 3492   suc csuc 4460   omcom 4686

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-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-iinf 4684

This theorem depends on definitions:  df-bi 117  df-3an 1004  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-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-uni 3892  df-int 3927  df-suc 4466  df-iom 4687

This theorem is referenced by:  nnsuc  4712  nnpredcl  4719  frecabcl  6560  nnsucuniel  6658  nneneq  7038  phpm  7047  dif1enen  7062  fin0  7067  fin0or  7068  diffisn  7075