Theorem finds 4698

Description: Principle of Finite Induction (inference schema), using implicit substitutions. The first four hypotheses establish the substitutions we need. The last two are the basis and the induction step. Theorem Schema 22 of [Suppes] p. 136. This is Metamath 100 proof #74. (Contributed by NM, 14-Apr-1995.)

Hypotheses

Ref	Expression
finds.1	|- ( x = (/) -> ( ph <-> ps ) )
finds.2	|- ( x = y -> ( ph <-> ch ) )
finds.3	|- ( x = suc y -> ( ph <-> th ) )
finds.4	|- ( x = A -> ( ph <-> ta ) )
finds.5	|- ps
finds.6	|- ( y e. om -> ( ch -> th ) )

Assertion

Ref	Expression
finds	|- ( A e. om -> 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 finds

Step	Hyp	Ref	Expression
1		finds.5	. . . . 5 |- ps
2		0ex 4216	. . . . . 6 |- (/) e. _V
3		finds.1	. . . . . 6 |- ( x = (/) -> ( ph <-> ps ) )
4	2, 3	elab 2950	. . . . 5 |- ( (/) e. { x | ph } <-> ps )
5	1, 4	mpbir 146	. . . 4 |- (/) e. { x | ph }
6		finds.6	. . . . . 6 |- ( y e. om -> ( ch -> th ) )
7		vex 2805	. . . . . . 7 |- y e. _V
8		finds.2	. . . . . . 7 |- ( x = y -> ( ph <-> ch ) )
9	7, 8	elab 2950	. . . . . 6 |- ( y e. { x | ph } <-> ch )
10	7	sucex 4597	. . . . . . 7 |- suc y e. _V
11		finds.3	. . . . . . 7 |- ( x = suc y -> ( ph <-> th ) )
12	10, 11	elab 2950	. . . . . 6 |- ( suc y e. { x | ph } <-> th )
13	6, 9, 12	3imtr4g 205	. . . . 5 |- ( y e. om -> ( y e. { x | ph } -> suc y e. { x | ph } ) )
14	13	rgen 2585	. . . 4 |- A. y e. om ( y e. { x | ph } -> suc y e. { x | ph } )
15		peano5 4696	. . . 4 |- ( ( (/) e. { x | ph } /\ A. y e. om ( y e. { x | ph } -> suc y e. { x | ph } ) ) -> om C_ { x | ph } )
16	5, 14, 15	mp2an 426	. . 3 |- om C_ { x | ph }
17	16	sseli 3223	. 2 |- ( A e. om -> A e. { x | ph } )
18		finds.4	. . 3 |- ( x = A -> ( ph <-> ta ) )
19	18	elabg 2952	. 2 |- ( A e. om -> ( A e. { x | ph } <-> ta ) )
20	17, 19	mpbid 147	1 |- ( A e. om -> ta )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1397   e. wcel 2202   {cab 2217   A.wral 2510   C_ wss 3200   (/)c0 3494   suc csuc 4462   omcom 4688

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-uni 3894  df-int 3929  df-suc 4468  df-iom 4689

This theorem is referenced by:  findes  4701  nn0suc  4702  elomssom  4703  ordom  4705  nndceq0  4716  0elnn  4717  omsinds  4720  nna0r  6645  nnm0r  6646  nnsucelsuc  6658  nneneq  7042  php5  7043  php5dom  7048  fidcenumlemrk  7152  fidcenumlemr  7153  nninfninc  7321  nnnninfeq  7326  nnnninfeq2  7327  frec2uzltd  10664  frecuzrdgg  10677  seq3val  10721  seqvalcd  10722  omgadd  11064  zfz1iso  11104  ennnfonelemhom  13035  nninfsellemdc  16612  nnnninfex  16624