Theorem peano2z 9691

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 9659	. . 3 |- ( N e. ZZ -> N e. RR )
2		1red 8347	. . 3 |- ( N e. ZZ -> 1 e. RR )
3	1, 2	readdcld 8361	. 2 |- ( N e. ZZ -> ( N + 1 ) e. RR )
4		elznn0nn 9669	. . . . 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 9614	. . . . 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 8347	. . . . . . . . 9 |- ( ( N e. ZZ /\ -u N e. NN ) -> 1 e. RR )
13	11, 12	readdcld 8361	. . . . . . . 8 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( N + 1 ) e. RR )
14	13	renegcld 8714	. . . . . . 7 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) e. RR )
15	14	recnd 8360	. . . . . 6 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) e. CC )
16	11	recnd 8360	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ -u N e. NN ) -> N e. CC )
17		1cnd 8348	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ -u N e. NN ) -> 1 e. CC )
18	16, 17	negdid 8657	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) = ( -u N + -u 1 ) )
19	18	oveq1d 6103	. . . . . . . . . 10 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( -u ( N + 1 ) + 1 ) = ( ( -u N + -u 1 ) + 1 ) )
20	16	negcld 8631	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u N e. CC )
21		neg1cn 9418	. . . . . . . . . . . 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 8354	. . . . . . . . . 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 8278	. . . . . . . . . . 11 |- 1 e. CC
26		1pneg1e0 9424	. . . . . . . . . . 11 |- ( 1 + -u 1 ) = 0
27	25, 21, 26	addcomli 8478	. . . . . . . . . 10 |- ( -u 1 + 1 ) = 0
28	27	oveq2i 6099	. . . . . . . . 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 8482	. . . . . . . 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 9616	. . . . . 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 9670	. 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 6088   CCcc 8183   RRcr 8184   0cc0 8185   1c1 8186   + caddc 8188   -ucneg 8505   NNcn 9313   NN0cn0 9574   ZZcz 9655

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-pow 4313  ax-pr 4348  ax-setind 4686  ax-cnex 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-distr 8289  ax-i2m1 8290  ax-0id 8293  ax-rnegex 8294  ax-cnre 8296

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 4132  df-opab 4194  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-iota 5340  df-fun 5382  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-sub 8506  df-neg 8507  df-inn 9314  df-n0 9575  df-z 9656

This theorem is used by:  zaddcllempos  9692  peano2zm  9693  zleltp1  9711  btwnnz  9751  peano2uz2  9764  uzind  9768  uzind2  9769  peano2zd  9782  eluzp1m1  9962  eluzp1p1  9964  peano2uz  9999  zltaddlt1le  10427  fzp1disj  10504  elfzp1b  10521  fzneuz  10525  fzp1nel  10528  fzval3  10639  fzossfzop1  10647  rebtwn2zlemstep  10704  flhalf  10758  frec2uzsucd  10859  zesq  11117  hashfzp1  11287  odd2np1lem  12664  odd2np1  12665  mulsucdiv2z  12677  oddp1d2  12682  zob  12683  ltoddhalfle  12685  fldivp1  13156  ppiprm  16259  ppinprm  16260  chtprm  16261  chtnprm  16262  ppiqp1le  16267  chtqub  16296  lgsdir2lem2  16353