Theorem php5 7163

Description: A natural number is not equinumerous to its successor. Corollary 10.21(1) of [TakeutiZaring] p. 90. (Contributed by NM, 26-Jul-2004.)

Assertion

Ref	Expression
php5	|- ( A e. om -> -. A ~~ suc A )

Proof of Theorem php5

Dummy variables w k are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		id 19	. . . 4 |- ( w = (/) -> w = (/) )
2		suceq 4549	. . . 4 |- ( w = (/) -> suc w = suc (/) )
3	1, 2	breq12d 4144	. . 3 |- ( w = (/) -> ( w ~~ suc w <-> (/) ~~ suc (/) ) )
4	3	notbid 677	. 2 |- ( w = (/) -> ( -. w ~~ suc w <-> -. (/) ~~ suc (/) ) )
5		id 19	. . . 4 |- ( w = k -> w = k )
6		suceq 4549	. . . 4 |- ( w = k -> suc w = suc k )
7	5, 6	breq12d 4144	. . 3 |- ( w = k -> ( w ~~ suc w <-> k ~~ suc k ) )
8	7	notbid 677	. 2 |- ( w = k -> ( -. w ~~ suc w <-> -. k ~~ suc k ) )
9		id 19	. . . 4 |- ( w = suc k -> w = suc k )
10		suceq 4549	. . . 4 |- ( w = suc k -> suc w = suc suc k )
11	9, 10	breq12d 4144	. . 3 |- ( w = suc k -> ( w ~~ suc w <-> suc k ~~ suc suc k ) )
12	11	notbid 677	. 2 |- ( w = suc k -> ( -. w ~~ suc w <-> -. suc k ~~ suc suc k ) )
13		id 19	. . . 4 |- ( w = A -> w = A )
14		suceq 4549	. . . 4 |- ( w = A -> suc w = suc A )
15	13, 14	breq12d 4144	. . 3 |- ( w = A -> ( w ~~ suc w <-> A ~~ suc A ) )
16	15	notbid 677	. 2 |- ( w = A -> ( -. w ~~ suc w <-> -. A ~~ suc A ) )
17		peano1 4743	. . . . 5 |- (/) e. om
18		peano3 4745	. . . . 5 |- ( (/) e. om -> suc (/) =/= (/) )
19	17, 18	ax-mp 5	. . . 4 |- suc (/) =/= (/)
20		en0 7086	. . . 4 |- ( suc (/) ~~ (/) <-> suc (/) = (/) )
21	19, 20	nemtbir 2509	. . 3 |- -. suc (/) ~~ (/)
22		ensymb 7071	. . 3 |- ( suc (/) ~~ (/) <-> (/) ~~ suc (/) )
23	21, 22	mtbi 681	. 2 |- -. (/) ~~ suc (/)
24		peano2 4744	. . . 4 |- ( k e. om -> suc k e. om )
25		vex 2824	. . . . 5 |- k e. _V
26	25	sucex 4648	. . . . 5 |- suc k e. _V
27	25, 26	phplem4 7160	. . . 4 |- ( ( k e. om /\ suc k e. om ) -> ( suc k ~~ suc suc k -> k ~~ suc k ) )
28	24, 27	mpdan 425	. . 3 |- ( k e. om -> ( suc k ~~ suc suc k -> k ~~ suc k ) )
29	28	con3d 640	. 2 |- ( k e. om -> ( -. k ~~ suc k -> -. suc k ~~ suc suc k ) )
30	4, 8, 12, 16, 23, 29	finds 4749	1 |- ( A e. om -> -. A ~~ suc A )

This proof depends on syntax axioms:   -. wn 3   -> wi 4   = wceq 1402   e. wcel 2209   =/= wne 2420   (/)c0 3520   class class class wbr 4131   suc csuc 4512   omcom 4739   ~~ cen 7024

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-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  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-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-er 6811  df-en 7027

This theorem is used by:  snnen2og  7164  1nen2  7166  php5dom  7168  php5fin  7190