Theorem tfinds 7059

Description: Principle of Transfinite Induction (inference schema), using implicit substitutions. The first four hypotheses establish the substitutions we need. The last three are the basis, the induction step for successors, and the induction step for limit ordinals. Theorem Schema 4 of [Suppes] p. 197. (Contributed by NM, 16-Apr-1995.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Hypotheses

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

Assertion

Ref	Expression
tfinds	|- ( A e. On -> ta )

Distinct variable groups:   x, y   x, A   ch, x   ta, x   ph, y

Allowed substitution hints:   ph( x)   ps( x, y)   ch( y)   th( x, y)   ta( y)   A( y)

Proof of Theorem tfinds

Dummy variable z is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfinds.2	. 2 |- ( x = y -> ( ph <-> ch ) )
2		tfinds.4	. 2 |- ( x = A -> ( ph <-> ta ) )
3		dflim3 7047	. . . . 5 |- ( Lim x <-> ( Ord x /\ -. ( x = (/) \/ E. y e. On x = suc y ) ) )
4	3	notbii 310	. . . 4 |- ( -. Lim x <-> -. ( Ord x /\ -. ( x = (/) \/ E. y e. On x = suc y ) ) )
5		iman 440	. . . . 5 |- ( ( Ord x -> ( x = (/) \/ E. y e. On x = suc y ) ) <-> -. ( Ord x /\ -. ( x = (/) \/ E. y e. On x = suc y ) ) )
6		eloni 5733	. . . . . . 7 |- ( x e. On -> Ord x )
7		pm2.27 42	. . . . . . 7 |- ( Ord x -> ( ( Ord x -> ( x = (/) \/ E. y e. On x = suc y ) ) -> ( x = (/) \/ E. y e. On x = suc y ) ) )
8	6, 7	syl 17	. . . . . 6 |- ( x e. On -> ( ( Ord x -> ( x = (/) \/ E. y e. On x = suc y ) ) -> ( x = (/) \/ E. y e. On x = suc y ) ) )
9		tfinds.5	. . . . . . . . 9 |- ps
10		tfinds.1	. . . . . . . . 9 |- ( x = (/) -> ( ph <-> ps ) )
11	9, 10	mpbiri 248	. . . . . . . 8 |- ( x = (/) -> ph )
12	11	a1d 25	. . . . . . 7 |- ( x = (/) -> ( A. y e. x ch -> ph ) )
13		nfra1 2941	. . . . . . . . 9 |- F/ y A. y e. x ch
14		nfv 1843	. . . . . . . . 9 |- F/ y ph
15	13, 14	nfim 1825	. . . . . . . 8 |- F/ y ( A. y e. x ch -> ph )
16		vex 3203	. . . . . . . . . . . . 13 |- y e. _V
17	16	sucid 5804	. . . . . . . . . . . 12 |- y e. suc y
18	1	rspcv 3305	. . . . . . . . . . . 12 |- ( y e. suc y -> ( A. x e. suc y ph -> ch ) )
19	17, 18	ax-mp 5	. . . . . . . . . . 11 |- ( A. x e. suc y ph -> ch )
20		tfinds.6	. . . . . . . . . . 11 |- ( y e. On -> ( ch -> th ) )
21	19, 20	syl5 34	. . . . . . . . . 10 |- ( y e. On -> ( A. x e. suc y ph -> th ) )
22		raleq 3138	. . . . . . . . . . . 12 |- ( x = suc y -> ( A. z e. x [ z / x ] ph <-> A. z e. suc y [ z / x ] ph ) )
23		nfv 1843	. . . . . . . . . . . . . . 15 |- F/ x ch
24	23, 1	sbie 2408	. . . . . . . . . . . . . 14 |- ( [ y / x ] ph <-> ch )
25		sbequ 2376	. . . . . . . . . . . . . 14 |- ( y = z -> ( [ y / x ] ph <-> [ z / x ] ph ) )
26	24, 25	syl5bbr 274	. . . . . . . . . . . . 13 |- ( y = z -> ( ch <-> [ z / x ] ph ) )
27	26	cbvralv 3171	. . . . . . . . . . . 12 |- ( A. y e. x ch <-> A. z e. x [ z / x ] ph )
28		cbvralsv 3182	. . . . . . . . . . . 12 |- ( A. x e. suc y ph <-> A. z e. suc y [ z / x ] ph )
29	22, 27, 28	3bitr4g 303	. . . . . . . . . . 11 |- ( x = suc y -> ( A. y e. x ch <-> A. x e. suc y ph ) )
30	29	imbi1d 331	. . . . . . . . . 10 |- ( x = suc y -> ( ( A. y e. x ch -> th ) <-> ( A. x e. suc y ph -> th ) ) )
31	21, 30	syl5ibrcom 237	. . . . . . . . 9 |- ( y e. On -> ( x = suc y -> ( A. y e. x ch -> th ) ) )
32		tfinds.3	. . . . . . . . . . 11 |- ( x = suc y -> ( ph <-> th ) )
33	32	biimprd 238	. . . . . . . . . 10 |- ( x = suc y -> ( th -> ph ) )
34	33	a1i 11	. . . . . . . . 9 |- ( y e. On -> ( x = suc y -> ( th -> ph ) ) )
35	31, 34	syldd 72	. . . . . . . 8 |- ( y e. On -> ( x = suc y -> ( A. y e. x ch -> ph ) ) )
36	15, 35	rexlimi 3024	. . . . . . 7 |- ( E. y e. On x = suc y -> ( A. y e. x ch -> ph ) )
37	12, 36	jaoi 394	. . . . . 6 |- ( ( x = (/) \/ E. y e. On x = suc y ) -> ( A. y e. x ch -> ph ) )
38	8, 37	syl6 35	. . . . 5 |- ( x e. On -> ( ( Ord x -> ( x = (/) \/ E. y e. On x = suc y ) ) -> ( A. y e. x ch -> ph ) ) )
39	5, 38	syl5bir 233	. . . 4 |- ( x e. On -> ( -. ( Ord x /\ -. ( x = (/) \/ E. y e. On x = suc y ) ) -> ( A. y e. x ch -> ph ) ) )
40	4, 39	syl5bi 232	. . 3 |- ( x e. On -> ( -. Lim x -> ( A. y e. x ch -> ph ) ) )
41		tfinds.7	. . 3 |- ( Lim x -> ( A. y e. x ch -> ph ) )
42	40, 41	pm2.61d2 172	. 2 |- ( x e. On -> ( A. y e. x ch -> ph ) )
43	1, 2, 42	tfis3 7057	1 |- ( A e. On -> ta )

Syntax hints:   -. wn 3   -> wi 4   <-> wb 196   \/ wo 383   /\ wa 384   = wceq 1483   [wsb 1880   e. wcel 1990   A.wral 2912   E.wrex 2913   (/)c0 3915   Ord word 5722   Oncon0 5723   Lim wlim 5724   suc csuc 5725

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-tr 4753  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729

This theorem is referenced by:  tfindsg  7060  tfindes  7062  tfinds3  7064  oa0r  7618  om0r  7619  om1r  7623  oe1m  7625  oeoalem  7676  r1sdom  8637  r1tr  8639  alephon  8892  alephcard  8893  alephordi  8897  rdgprc  31700