Theorem tfis 3117

Description: Transfinite Induction Schema. If all ordinal numbers less than a given number x have a property (induction hypothesis), then all ordinal numbers have the property (conclusion). Exercise 25 of [Enderton] p. 200.

Hypothesis

Ref	Expression
tfis.1	|- (x e. On -> (A.y e. x [y / x]ph -> ph))

Assertion

Ref	Expression
tfis	|- (x e. On -> ph)

Distinct variable groups:   ph,y   x,y

Proof of Theorem tfis

Step	Hyp	Ref	Expression
1		ssrab2 2121	. . . . 5 |- {x e. On | ph} (_ On
2		ax-17 968	. . . . . . . . . . 11 |- (z e. On -> A.x z e. On)
3		ax-17 968	. . . . . . . . . . . . 13 |- (y e. z -> A.x y e. z)
4		hbs1 1327	. . . . . . . . . . . . 13 |- ([y / x]ph -> A.x[y / x]ph)
5	3, 4	hbral 1678	. . . . . . . . . . . 12 |- (A.y e. z [y / x]ph -> A.xA.y e. z [y / x]ph)
6		hbs1 1327	. . . . . . . . . . . 12 |- ([z / x]ph -> A.x[z / x]ph)
7	5, 6	hbim 1004	. . . . . . . . . . 11 |- ((A.y e. z [y / x]ph -> [z / x]ph) -> A.x(A.y e. z [y / x]ph -> [z / x]ph))
8	2, 7	hbim 1004	. . . . . . . . . 10 |- ((z e. On -> (A.y e. z [y / x]ph -> [z / x]ph)) -> A.x(z e. On -> (A.y e. z [y / x]ph -> [z / x]ph)))
9		eleq1 1526	. . . . . . . . . . 11 |- (x = z -> (x e. On <-> z e. On))
10		raleq1 1778	. . . . . . . . . . . 12 |- (x = z -> (A.y e. x [y / x]ph <-> A.y e. z [y / x]ph))
11		sbequ12 1177	. . . . . . . . . . . 12 |- (x = z -> (ph <-> [z / x]ph))
12	10, 11	imbi12d 624	. . . . . . . . . . 11 |- (x = z -> ((A.y e. x [y / x]ph -> ph) <-> (A.y e. z [y / x]ph -> [z / x]ph)))
13	9, 12	imbi12d 624	. . . . . . . . . 10 |- (x = z -> ((x e. On -> (A.y e. x [y / x]ph -> ph)) <-> (z e. On -> (A.y e. z [y / x]ph -> [z / x]ph))))
14		tfis.1	. . . . . . . . . 10 |- (x e. On -> (A.y e. x [y / x]ph -> ph))
15	8, 13, 14	chvar 1163	. . . . . . . . 9 |- (z e. On -> (A.y e. z [y / x]ph -> [z / x]ph))
16		dfss3 2049	. . . . . . . . . 10 |- (z (_ {x e. On | ph} <-> A.y e. z y e. {x e. On | ph})
17	2	elrabsf 1953	. . . . . . . . . . . 12 |- (y e. {x e. On | ph} <-> (y e. On /\ [y / x]ph))
18	17	pm3.27bi 326	. . . . . . . . . . 11 |- (y e. {x e. On | ph} -> [y / x]ph)
19	18	r19.20si 1698	. . . . . . . . . 10 |- (A.y e. z y e. {x e. On | ph} -> A.y e. z [y / x]ph)
20	16, 19	sylbi 199	. . . . . . . . 9 |- (z (_ {x e. On | ph} -> A.y e. z [y / x]ph)
21	15, 20	syl5 21	. . . . . . . 8 |- (z e. On -> (z (_ {x e. On | ph} -> [z / x]ph))
22	21	anc2li 302	. . . . . . 7 |- (z e. On -> (z (_ {x e. On | ph} -> (z e. On /\ [z / x]ph)))
23	2	elrabsf 1953	. . . . . . 7 |- (z e. {x e. On | ph} <-> (z e. On /\ [z / x]ph))
24	22, 23	syl6ibr 213	. . . . . 6 |- (z e. On -> (z (_ {x e. On | ph} -> z e. {x e. On | ph}))
25	24	rgen 1690	. . . . 5 |- A.z e. On (z (_ {x e. On | ph} -> z e. {x e. On | ph})
26		tfi 3116	. . . . 5 |- (({x e. On | ph} (_ On /\ A.z e. On (z (_ {x e. On | ph} -> z e. {x e. On | ph})) -> {x e. On | ph} = On)
27	1, 25, 26	mp2an 695	. . . 4 |- {x e. On | ph} = On
28	27	eqcomi 1471	. . 3 |- On = {x e. On | ph}
29	28	rabeq2i 1801	. 2 |- (x e. On <-> (x e. On /\ ph))
30	29	pm3.27bi 326	1 |- (x e. On -> ph)

Syntax hints:   -> wi 3   /\ wa 223   = wceq 953   e. wcel 955  [wsbc 1166  A.wral 1637  {crab 1640   (_ wss 2037  Oncon0 2938

This theorem is referenced by:  tfis2f 3118

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-9 962  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732  ax-pr 2769  ax-un 2857

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 774  df-3an 775  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-ral 1641  df-rex 1642  df-rab 1644  df-v 1803  df-sbc 1932  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-tp 2405  df-op 2406  df-uni 2494  df-br 2610  df-opab 2657  df-tr 2671  df-eprel 2821  df-po 2831  df-so 2841  df-fr 2907  df-we 2924  df-ord 2941  df-on 2942

Copyright terms: Public domain