Theorem finds2 2399

Description: Principle of Finite Induction (inference schema) with implicit substitutions. The first three hypotheses establish the substitutions we need. The last two are the basis and the induction hypothesis. Theorem Schema 22 of [Suppes] p. 136.

Hypotheses

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

Assertion

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

Distinct variable group(s):   x,y,ta   ps,x   ch,x   th,x   ph,y

Proof of Theorem finds2

Step	Hyp	Ref	Expression
1		finds2.4	. . . . 5 |- (ta -> ps)
2		0ex 1745	. . . . . 6 |- (/) e. V
3		finds2.1	. . . . . . 7 |- (x = (/) -> (ph <-> ps))
4	3	imbi2d 464	. . . . . 6 |- (x = (/) -> ((ta -> ph) <-> (ta -> ps)))
5	2, 4	elab 1415	. . . . 5 |- ((/) e. {x | (ta -> ph)} <-> (ta -> ps))
6	1, 5	mpbir 165	. . . 4 |- (/) e. {x | (ta -> ph)}
7		finds2.5	. . . . . . 7 |- (y e. om -> (ta -> (ch -> th)))
8	7	a2d 15	. . . . . 6 |- (y e. om -> ((ta -> ch) -> (ta -> th)))
9		visset 1350	. . . . . . 7 |- y e. V
10		finds2.2	. . . . . . . 8 |- (x = y -> (ph <-> ch))
11	10	imbi2d 464	. . . . . . 7 |- (x = y -> ((ta -> ph) <-> (ta -> ch)))
12	9, 11	elab 1415	. . . . . 6 |- (y e. {x | (ta -> ph)} <-> (ta -> ch))
13	9	sucex 2303	. . . . . . 7 |- suc y e. V
14		finds2.3	. . . . . . . 8 |- (x = suc y -> (ph <-> th))
15	14	imbi2d 464	. . . . . . 7 |- (x = suc y -> ((ta -> ph) <-> (ta -> th)))
16	13, 15	elab 1415	. . . . . 6 |- (suc y e. {x | (ta -> ph)} <-> (ta -> th))
17	8, 12, 16	3imtr4g 426	. . . . 5 |- (y e. om -> (y e. {x | (ta -> ph)} -> suc y e. {x | (ta -> ph)}))
18	17	rgen 1247	. . . 4 |- A.y e. om (y e. {x | (ta -> ph)} -> suc y e. {x | (ta -> ph)})
19		peano5 2394	. . . 4 |- (((/) e. {x | (ta -> ph)} /\ A.y e. om (y e. {x | (ta -> ph)} -> suc y e. {x | (ta -> ph)})) -> om (_ {x | (ta -> ph)})
20	6, 18, 19	mp2an 520	. . 3 |- om (_ {x | (ta -> ph)}
21	20	sseli 1504	. 2 |- (x e. om -> x e. {x | (ta -> ph)})
22		abid 1094	. 2 |- (x e. {x | (ta -> ph)} <-> (ta -> ph))
23	21, 22	sylib 173	1 |- (x e. om -> (ta -> ph))

Syntax hints:   -> wi 2   <-> wb 127   = weq 797  {cab 1090   = wceq 1091   e. wcel 1092  A.wral 1201   (_ wss 1487  (/)c0 1707  suc csuc 2201  omcom 2372

This theorem is referenced by:  omsmolem 3195  unblem2 3432  fiint 3445  trcl 3489

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-13 804  ax-14 805  ax-16 922  ax-17 925  ax-ext 1074  ax-rep 1075  ax-un 1076  ax-pow 1077

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-3an 583  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ral 1205  df-rex 1206  df-v 1349  df-dif 1489  df-un 1490  df-in 1491  df-ss 1492  df-nul 1708  df-if 1777  df-pw 1799  df-sn 1811  df-pr 1812  df-tp 1814  df-op 1815  df-uni 1920  df-tr 2042  df-br 2063  df-opab 2098  df-eprel 2122  df-po 2128  df-so 2138  df-fr 2169  df-we 2186  df-ord 2202  df-on 2203  df-lim 2204  df-suc 2205  df-om 2373

metamath.org