Theorem findes 4707

Description: Finite induction with explicit substitution. The first hypothesis is the basis and the second is the induction step. Theorem Schema 22 of [Suppes] p. 136. This is an alternative for Metamath 100 proof #74. (Contributed by Raph Levien, 9-Jul-2003.)

Hypotheses

Ref	Expression
findes.1	|- [. (/) / x ]. ph
findes.2	|- ( x e. om -> ( ph -> [. suc x / x ]. ph ) )

Assertion

Ref	Expression
findes	|- ( x e. om -> ph )

Proof of Theorem findes

Dummy variables y z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfsbcq2 3035	. 2 |- ( z = (/) -> ( [ z / x ] ph <-> [. (/) / x ]. ph ) )
2		sbequ 1888	. 2 |- ( z = y -> ( [ z / x ] ph <-> [ y / x ] ph ) )
3		dfsbcq2 3035	. 2 |- ( z = suc y -> ( [ z / x ] ph <-> [. suc y / x ]. ph ) )
4		sbequ12r 1820	. 2 |- ( z = x -> ( [ z / x ] ph <-> ph ) )
5		findes.1	. 2 |- [. (/) / x ]. ph
6		nfv 1577	. . . 4 |- F/ x y e. om
7		nfs1v 1992	. . . . 5 |- F/ x [ y / x ] ph
8		nfsbc1v 3051	. . . . 5 |- F/ x [. suc y / x ]. ph
9	7, 8	nfim 1621	. . . 4 |- F/ x ( [ y / x ] ph -> [. suc y / x ]. ph )
10	6, 9	nfim 1621	. . 3 |- F/ x ( y e. om -> ( [ y / x ] ph -> [. suc y / x ]. ph ) )
11		eleq1 2294	. . . 4 |- ( x = y -> ( x e. om <-> y e. om ) )
12		sbequ12 1819	. . . . 5 |- ( x = y -> ( ph <-> [ y / x ] ph ) )
13		suceq 4505	. . . . . 6 |- ( x = y -> suc x = suc y )
14		dfsbcq 3034	. . . . . 6 |- ( suc x = suc y -> ( [. suc x / x ]. ph <-> [. suc y / x ]. ph ) )
15	13, 14	syl 14	. . . . 5 |- ( x = y -> ( [. suc x / x ]. ph <-> [. suc y / x ]. ph ) )
16	12, 15	imbi12d 234	. . . 4 |- ( x = y -> ( ( ph -> [. suc x / x ]. ph ) <-> ( [ y / x ] ph -> [. suc y / x ]. ph ) ) )
17	11, 16	imbi12d 234	. . 3 |- ( x = y -> ( ( x e. om -> ( ph -> [. suc x / x ]. ph ) ) <-> ( y e. om -> ( [ y / x ] ph -> [. suc y / x ]. ph ) ) ) )
18		findes.2	. . 3 |- ( x e. om -> ( ph -> [. suc x / x ]. ph ) )
19	10, 17, 18	chvar 1805	. 2 |- ( y e. om -> ( [ y / x ] ph -> [. suc y / x ]. ph ) )
20	1, 2, 3, 4, 5, 19	finds 4704	1 |- ( x e. om -> ph )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1398   [wsb 1810   e. wcel 2202   [.wsbc 3032   (/)c0 3496   suc csuc 4468   omcom 4694

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-iinf 4692

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-uni 3899  df-int 3934  df-suc 4474  df-iom 4695

This theorem is referenced by: (None)