Theorem peano2z 9680

Description: Second Peano postulate generalized to integers. (Contributed by NM, 13-Feb-2005.)

Assertion

Ref	Expression
peano2z	|- ( N e. ZZ -> ( N + 1 ) e. ZZ )

Proof of Theorem peano2z

Step	Hyp	Ref	Expression
1		zre 9648	. . 3 |- ( N e. ZZ -> N e. RR )
2		1red 8341	. . 3 |- ( N e. ZZ -> 1 e. RR )
3	1, 2	readdcld 8355	. 2 |- ( N e. ZZ -> ( N + 1 ) e. RR )
4		elznn0nn 9658	. . . . 5 |- ( N e. ZZ <-> ( N e. NN0 \/ ( N e. RR /\ -u N e. NN ) ) )
5	4	biimpi 120	. . . 4 |- ( N e. ZZ -> ( N e. NN0 \/ ( N e. RR /\ -u N e. NN ) ) )
6	1	biantrurd 305	. . . . 5 |- ( N e. ZZ -> ( -u N e. NN <-> ( N e. RR /\ -u N e. NN ) ) )
7	6	orbi2d 802	. . . 4 |- ( N e. ZZ -> ( ( N e. NN0 \/ -u N e. NN ) <-> ( N e. NN0 \/ ( N e. RR /\ -u N e. NN ) ) ) )
8	5, 7	mpbird 167	. . 3 |- ( N e. ZZ -> ( N e. NN0 \/ -u N e. NN ) )
9		peano2nn0 9603	. . . . 5 |- ( N e. NN0 -> ( N + 1 ) e. NN0 )
10	9	a1i 9	. . . 4 |- ( N e. ZZ -> ( N e. NN0 -> ( N + 1 ) e. NN0 ) )
11	1	adantr 276	. . . . . . . . 9 |- ( ( N e. ZZ /\ -u N e. NN ) -> N e. RR )
12		1red 8341	. . . . . . . . 9 |- ( ( N e. ZZ /\ -u N e. NN ) -> 1 e. RR )
13	11, 12	readdcld 8355	. . . . . . . 8 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( N + 1 ) e. RR )
14	13	renegcld 8707	. . . . . . 7 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) e. RR )
15	14	recnd 8354	. . . . . 6 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) e. CC )
16	11	recnd 8354	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ -u N e. NN ) -> N e. CC )
17		1cnd 8342	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ -u N e. NN ) -> 1 e. CC )
18	16, 17	negdid 8650	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) = ( -u N + -u 1 ) )
19	18	oveq1d 6100	. . . . . . . . . 10 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( -u ( N + 1 ) + 1 ) = ( ( -u N + -u 1 ) + 1 ) )
20	16	negcld 8624	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u N e. CC )
21		neg1cn 9409	. . . . . . . . . . . 12 |- -u 1 e. CC
22	21	a1i 9	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u 1 e. CC )
23	20, 22, 17	addassd 8348	. . . . . . . . . 10 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( ( -u N + -u 1 ) + 1 ) = ( -u N + ( -u 1 + 1 ) ) )
24	19, 23	eqtrd 2271	. . . . . . . . 9 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( -u ( N + 1 ) + 1 ) = ( -u N + ( -u 1 + 1 ) ) )
25		ax-1cn 8272	. . . . . . . . . . 11 |- 1 e. CC
26		1pneg1e0 9415	. . . . . . . . . . 11 |- ( 1 + -u 1 ) = 0
27	25, 21, 26	addcomli 8471	. . . . . . . . . 10 |- ( -u 1 + 1 ) = 0
28	27	oveq2i 6096	. . . . . . . . 9 |- ( -u N + ( -u 1 + 1 ) ) = ( -u N + 0 )
29	24, 28	eqtrdi 2287	. . . . . . . 8 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( -u ( N + 1 ) + 1 ) = ( -u N + 0 ) )
30	20	addridd 8475	. . . . . . . 8 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( -u N + 0 ) = -u N )
31	29, 30	eqtrd 2271	. . . . . . 7 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( -u ( N + 1 ) + 1 ) = -u N )
32		simpr 110	. . . . . . 7 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u N e. NN )
33	31, 32	eqeltrd 2315	. . . . . 6 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( -u ( N + 1 ) + 1 ) e. NN )
34		elnn0nn 9605	. . . . . 6 |- ( -u ( N + 1 ) e. NN0 <-> ( -u ( N + 1 ) e. CC /\ ( -u ( N + 1 ) + 1 ) e. NN ) )
35	15, 33, 34	sylanbrc 421	. . . . 5 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) e. NN0 )
36	35	ex 115	. . . 4 |- ( N e. ZZ -> ( -u N e. NN -> -u ( N + 1 ) e. NN0 ) )
37	10, 36	orim12d 798	. . 3 |- ( N e. ZZ -> ( ( N e. NN0 \/ -u N e. NN ) -> ( ( N + 1 ) e. NN0 \/ -u ( N + 1 ) e. NN0 ) ) )
38	8, 37	mpd 13	. 2 |- ( N e. ZZ -> ( ( N + 1 ) e. NN0 \/ -u ( N + 1 ) e. NN0 ) )
39		elznn0 9659	. 2 |- ( ( N + 1 ) e. ZZ <-> ( ( N + 1 ) e. RR /\ ( ( N + 1 ) e. NN0 \/ -u ( N + 1 ) e. NN0 ) ) )
40	3, 38, 39	sylanbrc 421	1 |- ( N e. ZZ -> ( N + 1 ) e. ZZ )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   \/ wo 720   e. wcel 2209  (class class class)co 6085   CCcc 8177   RRcr 8178   0cc0 8179   1c1 8180   + caddc 8182   -ucneg 8498   NNcn 9304   NN0cn0 9563   ZZcz 9644

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 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290

This proof depends on definitions:  df-bi 117  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-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645

This theorem is used by:  zaddcllempos  9681  peano2zm  9682  zleltp1  9700  btwnnz  9740  peano2uz2  9753  uzind  9757  uzind2  9758  peano2zd  9771  eluzp1m1  9946  eluzp1p1  9948  peano2uz  9983  zltaddlt1le  10410  fzp1disj  10487  elfzp1b  10504  fzneuz  10508  fzp1nel  10511  fzval3  10622  fzossfzop1  10630  rebtwn2zlemstep  10687  flhalf  10737  frec2uzsucd  10838  zesq  11096  hashfzp1  11265  odd2np1lem  12639  odd2np1  12640  mulsucdiv2z  12652  oddp1d2  12657  zob  12658  ltoddhalfle  12660  fldivp1  13127  lgsdir2lem2  16148