Theorem nn0suc 4637

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 2200	. . 3 |- ( y = (/) -> ( y = (/) <-> (/) = (/) ) )
2		eqeq1 2200	. . . 4 |- ( y = (/) -> ( y = suc x <-> (/) = suc x ) )
3	2	rexbidv 2495	. . 3 |- ( y = (/) -> ( E. x e. om y = suc x <-> E. x e. om (/) = suc x ) )
4	1, 3	orbi12d 794	. 2 |- ( y = (/) -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( (/) = (/) \/ E. x e. om (/) = suc x ) ) )
5		eqeq1 2200	. . 3 |- ( y = z -> ( y = (/) <-> z = (/) ) )
6		eqeq1 2200	. . . 4 |- ( y = z -> ( y = suc x <-> z = suc x ) )
7	6	rexbidv 2495	. . 3 |- ( y = z -> ( E. x e. om y = suc x <-> E. x e. om z = suc x ) )
8	5, 7	orbi12d 794	. 2 |- ( y = z -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( z = (/) \/ E. x e. om z = suc x ) ) )
9		eqeq1 2200	. . 3 |- ( y = suc z -> ( y = (/) <-> suc z = (/) ) )
10		eqeq1 2200	. . . 4 |- ( y = suc z -> ( y = suc x <-> suc z = suc x ) )
11	10	rexbidv 2495	. . 3 |- ( y = suc z -> ( E. x e. om y = suc x <-> E. x e. om suc z = suc x ) )
12	9, 11	orbi12d 794	. 2 |- ( y = suc z -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( suc z = (/) \/ E. x e. om suc z = suc x ) ) )
13		eqeq1 2200	. . 3 |- ( y = A -> ( y = (/) <-> A = (/) ) )
14		eqeq1 2200	. . . 4 |- ( y = A -> ( y = suc x <-> A = suc x ) )
15	14	rexbidv 2495	. . 3 |- ( y = A -> ( E. x e. om y = suc x <-> E. x e. om A = suc x ) )
16	13, 15	orbi12d 794	. 2 |- ( y = A -> ( ( y = (/) \/ E. x e. om y = suc x ) <-> ( A = (/) \/ E. x e. om A = suc x ) ) )
17		eqid 2193	. . 3 |- (/) = (/)
18	17	orci 732	. 2 |- ( (/) = (/) \/ E. x e. om (/) = suc x )
19		eqid 2193	. . . . 5 |- suc z = suc z
20		suceq 4434	. . . . . . 7 |- ( x = z -> suc x = suc z )
21	20	eqeq2d 2205	. . . . . 6 |- ( x = z -> ( suc z = suc x <-> suc z = suc z ) )
22	21	rspcev 2865	. . . . 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 735	. . 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 4633	1 |- ( A e. om -> ( A = (/) \/ E. x e. om A = suc x ) )

Syntax hints:   -> wi 4   \/ wo 709   = wceq 1364   e. wcel 2164   E.wrex 2473   (/)c0 3447   suc csuc 4397   omcom 4623

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-iinf 4621

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-uni 3837  df-int 3872  df-suc 4403  df-iom 4624

This theorem is referenced by:  nnsuc  4649  nnpredcl  4656  frecabcl  6454  nnsucuniel  6550  nneneq  6915  phpm  6923  dif1enen  6938  fin0  6943  fin0or  6944  diffisn  6951