Theorem zindd 8465

Description: Principle of Mathematical Induction on all integers, deduction version. The first five hypotheses give the substitutions; the last three are the basis, the induction, and the extension to negative numbers. (Contributed by Paul Chapman, 17-Apr-2009.) (Proof shortened by Mario Carneiro, 4-Jan-2017.)

Hypotheses

Ref	Expression
zindd.1	|- ( x = 0 -> ( ph <-> ps ) )
zindd.2	|- ( x = y -> ( ph <-> ch ) )
zindd.3	|- ( x = ( y + 1 ) -> ( ph <-> ta ) )
zindd.4	|- ( x = -u y -> ( ph <-> th ) )
zindd.5	|- ( x = A -> ( ph <-> et ) )
zindd.6	|- ( ze -> ps )
zindd.7	|- ( ze -> ( y e. NN0 -> ( ch -> ta ) ) )
zindd.8	|- ( ze -> ( y e. NN -> ( ch -> th ) ) )

Assertion

Ref	Expression
zindd	|- ( ze -> ( A e. ZZ -> et ) )

Distinct variable groups:   x, A   ch, x   et, x   ph, y   ps, x   ta, x   th, x   x, y, ze

Allowed substitution hints:   ph( x)   ps( y)   ch( y)   th( y)   ta( y)   et( y)   A( y)

Proof of Theorem zindd

Step	Hyp	Ref	Expression
1		znegcl 8382	. . . . . . 7 |- ( y e. ZZ -> -u y e. ZZ )
2		elznn0nn 8365	. . . . . . 7 |- ( -u y e. ZZ <-> ( -u y e. NN0 \/ ( -u y e. RR /\ -u -u y e. NN ) ) )
3	1, 2	sylib 120	. . . . . 6 |- ( y e. ZZ -> ( -u y e. NN0 \/ ( -u y e. RR /\ -u -u y e. NN ) ) )
4		simpr 108	. . . . . . 7 |- ( ( -u y e. RR /\ -u -u y e. NN ) -> -u -u y e. NN )
5	4	orim2i 710	. . . . . 6 |- ( ( -u y e. NN0 \/ ( -u y e. RR /\ -u -u y e. NN ) ) -> ( -u y e. NN0 \/ -u -u y e. NN ) )
6	3, 5	syl 14	. . . . 5 |- ( y e. ZZ -> ( -u y e. NN0 \/ -u -u y e. NN ) )
7		zcn 8356	. . . . . . . 8 |- ( y e. ZZ -> y e. CC )
8	7	negnegd 7410	. . . . . . 7 |- ( y e. ZZ -> -u -u y = y )
9	8	eleq1d 2147	. . . . . 6 |- ( y e. ZZ -> ( -u -u y e. NN <-> y e. NN ) )
10	9	orbi2d 736	. . . . 5 |- ( y e. ZZ -> ( ( -u y e. NN0 \/ -u -u y e. NN ) <-> ( -u y e. NN0 \/ y e. NN ) ) )
11	6, 10	mpbid 145	. . . 4 |- ( y e. ZZ -> ( -u y e. NN0 \/ y e. NN ) )
12		zindd.1	. . . . . . . 8 |- ( x = 0 -> ( ph <-> ps ) )
13	12	imbi2d 228	. . . . . . 7 |- ( x = 0 -> ( ( ze -> ph ) <-> ( ze -> ps ) ) )
14		zindd.2	. . . . . . . 8 |- ( x = y -> ( ph <-> ch ) )
15	14	imbi2d 228	. . . . . . 7 |- ( x = y -> ( ( ze -> ph ) <-> ( ze -> ch ) ) )
16		zindd.3	. . . . . . . 8 |- ( x = ( y + 1 ) -> ( ph <-> ta ) )
17	16	imbi2d 228	. . . . . . 7 |- ( x = ( y + 1 ) -> ( ( ze -> ph ) <-> ( ze -> ta ) ) )
18		zindd.4	. . . . . . . 8 |- ( x = -u y -> ( ph <-> th ) )
19	18	imbi2d 228	. . . . . . 7 |- ( x = -u y -> ( ( ze -> ph ) <-> ( ze -> th ) ) )
20		zindd.6	. . . . . . 7 |- ( ze -> ps )
21		zindd.7	. . . . . . . . 9 |- ( ze -> ( y e. NN0 -> ( ch -> ta ) ) )
22	21	com12 30	. . . . . . . 8 |- ( y e. NN0 -> ( ze -> ( ch -> ta ) ) )
23	22	a2d 26	. . . . . . 7 |- ( y e. NN0 -> ( ( ze -> ch ) -> ( ze -> ta ) ) )
24	13, 15, 17, 19, 20, 23	nn0ind 8461	. . . . . 6 |- ( -u y e. NN0 -> ( ze -> th ) )
25	24	com12 30	. . . . 5 |- ( ze -> ( -u y e. NN0 -> th ) )
26		nnnn0 8295	. . . . . . . 8 |- ( y e. NN -> y e. NN0 )
27	13, 15, 17, 15, 20, 23	nn0ind 8461	. . . . . . . 8 |- ( y e. NN0 -> ( ze -> ch ) )
28	26, 27	syl 14	. . . . . . 7 |- ( y e. NN -> ( ze -> ch ) )
29	28	com12 30	. . . . . 6 |- ( ze -> ( y e. NN -> ch ) )
30		zindd.8	. . . . . 6 |- ( ze -> ( y e. NN -> ( ch -> th ) ) )
31	29, 30	mpdd 40	. . . . 5 |- ( ze -> ( y e. NN -> th ) )
32	25, 31	jaod 669	. . . 4 |- ( ze -> ( ( -u y e. NN0 \/ y e. NN ) -> th ) )
33	11, 32	syl5 32	. . 3 |- ( ze -> ( y e. ZZ -> th ) )
34	33	ralrimiv 2433	. 2 |- ( ze -> A. y e. ZZ th )
35		znegcl 8382	. . . . 5 |- ( x e. ZZ -> -u x e. ZZ )
36		negeq 7301	. . . . . . . . 9 |- ( y = -u x -> -u y = -u -u x )
37		zcn 8356	. . . . . . . . . 10 |- ( x e. ZZ -> x e. CC )
38	37	negnegd 7410	. . . . . . . . 9 |- ( x e. ZZ -> -u -u x = x )
39	36, 38	sylan9eqr 2135	. . . . . . . 8 |- ( ( x e. ZZ /\ y = -u x ) -> -u y = x )
40	39	eqcomd 2086	. . . . . . 7 |- ( ( x e. ZZ /\ y = -u x ) -> x = -u y )
41	40, 18	syl 14	. . . . . 6 |- ( ( x e. ZZ /\ y = -u x ) -> ( ph <-> th ) )
42	41	bicomd 139	. . . . 5 |- ( ( x e. ZZ /\ y = -u x ) -> ( th <-> ph ) )
43	35, 42	rspcdv 2704	. . . 4 |- ( x e. ZZ -> ( A. y e. ZZ th -> ph ) )
44	43	com12 30	. . 3 |- ( A. y e. ZZ th -> ( x e. ZZ -> ph ) )
45	44	ralrimiv 2433	. 2 |- ( A. y e. ZZ th -> A. x e. ZZ ph )
46		zindd.5	. . 3 |- ( x = A -> ( ph <-> et ) )
47	46	rspccv 2698	. 2 |- ( A. x e. ZZ ph -> ( A e. ZZ -> et ) )
48	34, 45, 47	3syl 17	1 |- ( ze -> ( A e. ZZ -> et ) )

Syntax hints:   -> wi 4   /\ wa 102   <-> wb 103   \/ wo 661   = wceq 1284   e. wcel 1433   A.wral 2348  (class class class)co 5532   RRcr 6980   0cc0 6981   1c1 6982   + caddc 6984   -ucneg 7280   NNcn 8039   NN0cn0 8288   ZZcz 8351

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-cnex 7067  ax-resscn 7068  ax-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-addcom 7076  ax-addass 7078  ax-distr 7080  ax-i2m1 7081  ax-0lt1 7082  ax-0id 7084  ax-rnegex 7085  ax-cnre 7087  ax-pre-ltirr 7088  ax-pre-ltwlin 7089  ax-pre-lttrn 7090  ax-pre-ltadd 7092

This theorem depends on definitions:  df-bi 115  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-nel 2340  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-iota 4887  df-fun 4924  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159  df-sub 7281  df-neg 7282  df-inn 8040  df-n0 8289  df-z 8352

This theorem is referenced by: (None)