Theorem nnind 8646

Description: Principle of Mathematical Induction (inference schema). The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. See nnaddcl 8650 for an example of its use. This is an alternative for Metamath 100 proof #74. (Contributed by NM, 10-Jan-1997.) (Revised by Mario Carneiro, 16-Jun-2013.)

Hypotheses

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

Assertion

Ref	Expression
nnind	|- ( A e. NN -> 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 nnind

Step	Hyp	Ref	Expression
1		1nn 8641	. . . . . 6 |- 1 e. NN
2		nnind.5	. . . . . 6 |- ps
3		nnind.1	. . . . . . 7 |- ( x = 1 -> ( ph <-> ps ) )
4	3	elrab 2809	. . . . . 6 |- ( 1 e. { x e. NN | ph } <-> ( 1 e. NN /\ ps ) )
5	1, 2, 4	mpbir2an 909	. . . . 5 |- 1 e. { x e. NN | ph }
6		elrabi 2806	. . . . . . 7 |- ( y e. { x e. NN | ph } -> y e. NN )
7		peano2nn 8642	. . . . . . . . . 10 |- ( y e. NN -> ( y + 1 ) e. NN )
8	7	a1d 22	. . . . . . . . 9 |- ( y e. NN -> ( y e. NN -> ( y + 1 ) e. NN ) )
9		nnind.6	. . . . . . . . 9 |- ( y e. NN -> ( ch -> th ) )
10	8, 9	anim12d 331	. . . . . . . 8 |- ( y e. NN -> ( ( y e. NN /\ ch ) -> ( ( y + 1 ) e. NN /\ th ) ) )
11		nnind.2	. . . . . . . . 9 |- ( x = y -> ( ph <-> ch ) )
12	11	elrab 2809	. . . . . . . 8 |- ( y e. { x e. NN | ph } <-> ( y e. NN /\ ch ) )
13		nnind.3	. . . . . . . . 9 |- ( x = ( y + 1 ) -> ( ph <-> th ) )
14	13	elrab 2809	. . . . . . . 8 |- ( ( y + 1 ) e. { x e. NN | ph } <-> ( ( y + 1 ) e. NN /\ th ) )
15	10, 12, 14	3imtr4g 204	. . . . . . 7 |- ( y e. NN -> ( y e. { x e. NN | ph } -> ( y + 1 ) e. { x e. NN | ph } ) )
16	6, 15	mpcom 36	. . . . . 6 |- ( y e. { x e. NN | ph } -> ( y + 1 ) e. { x e. NN | ph } )
17	16	rgen 2459	. . . . 5 |- A. y e. { x e. NN | ph } ( y + 1 ) e. { x e. NN | ph }
18		peano5nni 8633	. . . . 5 |- ( ( 1 e. { x e. NN | ph } /\ A. y e. { x e. NN | ph } ( y + 1 ) e. { x e. NN | ph } ) -> NN C_ { x e. NN | ph } )
19	5, 17, 18	mp2an 420	. . . 4 |- NN C_ { x e. NN | ph }
20	19	sseli 3059	. . 3 |- ( A e. NN -> A e. { x e. NN | ph } )
21		nnind.4	. . . 4 |- ( x = A -> ( ph <-> ta ) )
22	21	elrab 2809	. . 3 |- ( A e. { x e. NN | ph } <-> ( A e. NN /\ ta ) )
23	20, 22	sylib 121	. 2 |- ( A e. NN -> ( A e. NN /\ ta ) )
24	23	simprd 113	1 |- ( A e. NN -> ta )

Syntax hints:   -> wi 4   /\ wa 103   <-> wb 104   = wceq 1314   e. wcel 1463   A.wral 2390   {crab 2394   C_ wss 3037  (class class class)co 5728   1c1 7548   + caddc 7550   NNcn 8630

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4006  ax-cnex 7636  ax-resscn 7637  ax-1re 7639  ax-addrcl 7642

This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ral 2395  df-rex 2396  df-rab 2399  df-v 2659  df-un 3041  df-in 3043  df-ss 3050  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-int 3738  df-br 3896  df-iota 5046  df-fv 5089  df-ov 5731  df-inn 8631

This theorem is referenced by:  nnindALT  8647  nn1m1nn  8648  nnaddcl  8650  nnmulcl  8651  nnge1  8653  nn1gt1  8664  nnsub  8669  zaddcllempos  8995  zaddcllemneg  8997  nneoor  9057  peano5uzti  9063  nn0ind-raph  9072  indstr  9290  exbtwnzlemshrink  9919  exp3vallem  10187  expcllem  10197  expap0  10216  seq3coll  10478  resqrexlemover  10674  resqrexlemlo  10677  resqrexlemcalc3  10680  gcdmultiple  11554  rplpwr  11561  prmind2  11647  prmdvdsexp  11672  sqrt2irr  11686  pw2dvdslemn  11688