Theorem tfinds3 3161

Description: Principle of Transfinite Induction (inference schema) with implicit substitutions. The first four hypotheses establish the substitutions we need. The last three are the basis, the induction hypothesis for successors, and the induction hypothesis for limit ordinals.

Hypotheses

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

Assertion

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

Distinct variable groups:   ph,y   x,A   ps,x   ch,x   th,x   ta,x   x,y,et

Proof of Theorem tfinds3

Step	Hyp	Ref	Expression
1		tfinds3.1	. . 3 |- (x = (/) -> (ph <-> ps))
2	1	imbi2d 611	. 2 |- (x = (/) -> ((et -> ph) <-> (et -> ps)))
3		tfinds3.2	. . 3 |- (x = y -> (ph <-> ch))
4	3	imbi2d 611	. 2 |- (x = y -> ((et -> ph) <-> (et -> ch)))
5		tfinds3.3	. . 3 |- (x = suc y -> (ph <-> th))
6	5	imbi2d 611	. 2 |- (x = suc y -> ((et -> ph) <-> (et -> th)))
7		tfinds3.4	. . 3 |- (x = A -> (ph <-> ta))
8	7	imbi2d 611	. 2 |- (x = A -> ((et -> ph) <-> (et -> ta)))
9		tfinds3.5	. 2 |- (et -> ps)
10		tfinds3.6	. . 3 |- (y e. On -> (et -> (ch -> th)))
11	10	a2d 13	. 2 |- (y e. On -> ((et -> ch) -> (et -> th)))
12		tfinds3.7	. . . 4 |- (Lim x -> (et -> (A.y e. x ch -> ph)))
13	12	a2d 13	. . 3 |- (Lim x -> ((et -> A.y e. x ch) -> (et -> ph)))
14		r19.21v 1713	. . 3 |- (A.y e. x (et -> ch) <-> (et -> A.y e. x ch))
15	13, 14	syl5ib 206	. 2 |- (Lim x -> (A.y e. x (et -> ch) -> (et -> ph)))
16	2, 4, 6, 8, 9, 11, 15	tfinds 3156	1 |- (A e. On -> (et -> ta))

Syntax hints:   -> wi 3   <-> wb 146   = wceq 954   e. wcel 956  A.wral 1642  (/)c0 2276  Oncon0 2943  Lim wlim 2944  suc csuc 2945

This theorem is referenced by:  oacl 4160  omcl 4161  oecl 4162  oawordri 4174  oaass 4185  oarec 4186  omordi 4187  omwordri 4193  odi 4200  omass 4201  oen0 4203  oewordri 4209  oeworde 4210

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-9 963  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-nul 2705  ax-pow 2737  ax-pr 2774  ax-un 2861

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 775  df-3an 776  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-rex 1647  df-rab 1649  df-v 1808  df-sbc 1938  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-if 2358  df-pw 2398  df-sn 2408  df-pr 2409  df-tp 2411  df-op 2412  df-uni 2499  df-br 2615  df-opab 2662  df-tr 2676  df-eprel 2827  df-po 2835  df-so 2845  df-fr 2912  df-we 2929  df-ord 2946  df-on 2947  df-lim 2948  df-suc 2949

Copyright terms: Public domain