Theorem nn0ind-raph 9763

Description: Principle of Mathematical Induction (inference schema) on nonnegative integers. The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. Raph Levien remarks: "This seems a bit painful. I wonder if an explicit substitution version would be easier." (Contributed by Raph Levien, 10-Apr-2004.)

Hypotheses

Ref	Expression
nn0ind-raph.1	|- ( x = 0 -> ( ph <-> ps ) )
nn0ind-raph.2	|- ( x = y -> ( ph <-> ch ) )
nn0ind-raph.3	|- ( x = ( y + 1 ) -> ( ph <-> th ) )
nn0ind-raph.4	|- ( x = A -> ( ph <-> ta ) )
nn0ind-raph.5	|- ps
nn0ind-raph.6	|- ( y e. NN0 -> ( ch -> th ) )

Assertion

Ref	Expression
nn0ind-raph	|- ( A e. NN0 -> ta )

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

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

Proof of Theorem nn0ind-raph

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elnn0 9565	. 2 |- ( A e. NN0 <-> ( A e. NN \/ A = 0 ) )
2		dfsbcq2 3054	. . . 4 |- ( z = 1 -> ( [ z / x ] ph <-> [. 1 / x ]. ph ) )
3		nfv 1581	. . . . 5 |- F/ x ch
4		nn0ind-raph.2	. . . . 5 |- ( x = y -> ( ph <-> ch ) )
5	3, 4	sbhypf 2872	. . . 4 |- ( z = y -> ( [ z / x ] ph <-> ch ) )
6		nfv 1581	. . . . 5 |- F/ x th
7		nn0ind-raph.3	. . . . 5 |- ( x = ( y + 1 ) -> ( ph <-> th ) )
8	6, 7	sbhypf 2872	. . . 4 |- ( z = ( y + 1 ) -> ( [ z / x ] ph <-> th ) )
9		nfv 1581	. . . . 5 |- F/ x ta
10		nn0ind-raph.4	. . . . 5 |- ( x = A -> ( ph <-> ta ) )
11	9, 10	sbhypf 2872	. . . 4 |- ( z = A -> ( [ z / x ] ph <-> ta ) )
12		nfsbc1v 3070	. . . . 5 |- F/ x [. 1 / x ]. ph
13		1ex 8321	. . . . 5 |- 1 e. _V
14		c0ex 8320	. . . . . . 7 |- 0 e. _V
15		0nn0 9578	. . . . . . . . . . . 12 |- 0 e. NN0
16		eleq1a 2310	. . . . . . . . . . . 12 |- ( 0 e. NN0 -> ( y = 0 -> y e. NN0 ) )
17	15, 16	ax-mp 5	. . . . . . . . . . 11 |- ( y = 0 -> y e. NN0 )
18		nn0ind-raph.5	. . . . . . . . . . . . . . 15 |- ps
19		nn0ind-raph.1	. . . . . . . . . . . . . . 15 |- ( x = 0 -> ( ph <-> ps ) )
20	18, 19	mpbiri 168	. . . . . . . . . . . . . 14 |- ( x = 0 -> ph )
21		eqeq2 2248	. . . . . . . . . . . . . . . 16 |- ( y = 0 -> ( x = y <-> x = 0 ) )
22	21, 4	biimtrrdi 164	. . . . . . . . . . . . . . 15 |- ( y = 0 -> ( x = 0 -> ( ph <-> ch ) ) )
23	22	pm5.74d 182	. . . . . . . . . . . . . 14 |- ( y = 0 -> ( ( x = 0 -> ph ) <-> ( x = 0 -> ch ) ) )
24	20, 23	mpbii 148	. . . . . . . . . . . . 13 |- ( y = 0 -> ( x = 0 -> ch ) )
25	24	com12 30	. . . . . . . . . . . 12 |- ( x = 0 -> ( y = 0 -> ch ) )
26	14, 25	vtocle 2899	. . . . . . . . . . 11 |- ( y = 0 -> ch )
27		nn0ind-raph.6	. . . . . . . . . . 11 |- ( y e. NN0 -> ( ch -> th ) )
28	17, 26, 27	sylc 62	. . . . . . . . . 10 |- ( y = 0 -> th )
29	28	adantr 276	. . . . . . . . 9 |- ( ( y = 0 /\ x = 1 ) -> th )
30		oveq1 6092	. . . . . . . . . . . . 13 |- ( y = 0 -> ( y + 1 ) = ( 0 + 1 ) )
31		0p1e1 9418	. . . . . . . . . . . . 13 |- ( 0 + 1 ) = 1
32	30, 31	eqtrdi 2287	. . . . . . . . . . . 12 |- ( y = 0 -> ( y + 1 ) = 1 )
33	32	eqeq2d 2250	. . . . . . . . . . 11 |- ( y = 0 -> ( x = ( y + 1 ) <-> x = 1 ) )
34	33, 7	biimtrrdi 164	. . . . . . . . . 10 |- ( y = 0 -> ( x = 1 -> ( ph <-> th ) ) )
35	34	imp 124	. . . . . . . . 9 |- ( ( y = 0 /\ x = 1 ) -> ( ph <-> th ) )
36	29, 35	mpbird 167	. . . . . . . 8 |- ( ( y = 0 /\ x = 1 ) -> ph )
37	36	ex 115	. . . . . . 7 |- ( y = 0 -> ( x = 1 -> ph ) )
38	14, 37	vtocle 2899	. . . . . 6 |- ( x = 1 -> ph )
39		sbceq1a 3061	. . . . . 6 |- ( x = 1 -> ( ph <-> [. 1 / x ]. ph ) )
40	38, 39	mpbid 147	. . . . 5 |- ( x = 1 -> [. 1 / x ]. ph )
41	12, 13, 40	vtoclef 2898	. . . 4 |- [. 1 / x ]. ph
42		nnnn0 9570	. . . . 5 |- ( y e. NN -> y e. NN0 )
43	42, 27	syl 14	. . . 4 |- ( y e. NN -> ( ch -> th ) )
44	2, 5, 8, 11, 41, 43	nnind 9320	. . 3 |- ( A e. NN -> ta )
45		nfv 1581	. . . . 5 |- F/ x ( 0 = A -> ta )
46		eqeq1 2245	. . . . . 6 |- ( x = 0 -> ( x = A <-> 0 = A ) )
47	19	bicomd 141	. . . . . . . . 9 |- ( x = 0 -> ( ps <-> ph ) )
48	47, 10	sylan9bb 466	. . . . . . . 8 |- ( ( x = 0 /\ x = A ) -> ( ps <-> ta ) )
49	18, 48	mpbii 148	. . . . . . 7 |- ( ( x = 0 /\ x = A ) -> ta )
50	49	ex 115	. . . . . 6 |- ( x = 0 -> ( x = A -> ta ) )
51	46, 50	sylbird 170	. . . . 5 |- ( x = 0 -> ( 0 = A -> ta ) )
52	45, 14, 51	vtoclef 2898	. . . 4 |- ( 0 = A -> ta )
53	52	eqcoms 2241	. . 3 |- ( A = 0 -> ta )
54	44, 53	jaoi 728	. 2 |- ( ( A e. NN \/ A = 0 ) -> ta )
55	1, 54	sylbi 121	1 |- ( A e. NN0 -> ta )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 720   = wceq 1402   [wsb 1815   e. wcel 2209   [.wsbc 3051  (class class class)co 6085   0cc0 8179   1c1 8180   + caddc 8182   NNcn 9304   NN0cn0 9563

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  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-ext 2220  ax-sep 4249  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-i2m1 8284  ax-0id 8287

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-iota 5337  df-fv 5385  df-ov 6088  df-inn 9305  df-n0 9564

This theorem is used by: (None)