Theorem peano2z 9685

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 9653	. . 3 |- ( N e. ZZ -> N e. RR )
2		1red 8342	. . 3 |- ( N e. ZZ -> 1 e. RR )
3	1, 2	readdcld 8356	. 2 |- ( N e. ZZ -> ( N + 1 ) e. RR )
4		elznn0nn 9663	. . . . 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 9608	. . . . 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 8342	. . . . . . . . 9 |- ( ( N e. ZZ /\ -u N e. NN ) -> 1 e. RR )
13	11, 12	readdcld 8356	. . . . . . . 8 |- ( ( N e. ZZ /\ -u N e. NN ) -> ( N + 1 ) e. RR )
14	13	renegcld 8709	. . . . . . 7 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) e. RR )
15	14	recnd 8355	. . . . . 6 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u ( N + 1 ) e. CC )
16	11	recnd 8355	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ -u N e. NN ) -> N e. CC )
17		1cnd 8343	. . . . . . . . . . . 12 |- ( ( N e. ZZ /\ -u N e. NN ) -> 1 e. CC )
18	16, 17	negdid 8652	. . . . . . . . . . 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 8626	. . . . . . . . . . 11 |- ( ( N e. ZZ /\ -u N e. NN ) -> -u N e. CC )
21		neg1cn 9412	. . . . . . . . . . . 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 8349	. . . . . . . . . 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 8273	. . . . . . . . . . 11 |- 1 e. CC
26		1pneg1e0 9418	. . . . . . . . . . 11 |- ( 1 + -u 1 ) = 0
27	25, 21, 26	addcomli 8473	. . . . . . . . . 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 8477	. . . . . . . 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 9610	. . . . . 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 9664	. 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 8178   RRcr 8179   0cc0 8180   1c1 8181   + caddc 8183   -ucneg 8500   NNcn 9307   NN0cn0 9568   ZZcz 9649

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 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-distr 8284  ax-i2m1 8285  ax-0id 8288  ax-rnegex 8289  ax-cnre 8291

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 8501  df-neg 8502  df-inn 9308  df-n0 9569  df-z 9650

This theorem is used by:  zaddcllempos  9686  peano2zm  9687  zleltp1  9705  btwnnz  9745  peano2uz2  9758  uzind  9762  uzind2  9763  peano2zd  9776  eluzp1m1  9956  eluzp1p1  9958  peano2uz  9993  zltaddlt1le  10421  fzp1disj  10498  elfzp1b  10515  fzneuz  10519  fzp1nel  10522  fzval3  10633  fzossfzop1  10641  rebtwn2zlemstep  10698  flhalf  10752  frec2uzsucd  10853  zesq  11111  hashfzp1  11281  odd2np1lem  12658  odd2np1  12659  mulsucdiv2z  12671  oddp1d2  12676  zob  12677  ltoddhalfle  12679  fldivp1  13150  ppiprm  16220  ppinprm  16221  chtprm  16222  chtnprm  16223  ppiqp1le  16228  chtqub  16257  lgsdir2lem2  16314