HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem tfis2f 3128
Description: Transfinite Induction Schema with implicit substitution.
Hypotheses
Ref Expression
tfis2f.1 |- (ps -> A.xps)
tfis2f.2 |- (x = y -> (ph <-> ps))
tfis2f.3 |- (x e. On -> (A.y e. x ps -> ph))
Assertion
Ref Expression
tfis2f |- (x e. On -> ph)
Distinct variable groups:   ph,y   x,y

Proof of Theorem tfis2f
StepHypRef Expression
1 tfis2f.3 . . 3 |- (x e. On -> (A.y e. x ps -> ph))
2 tfis2f.1 . . . . 5 |- (ps -> A.xps)
3 tfis2f.2 . . . . 5 |- (x = y -> (ph <-> ps))
42, 3sbie 1196 . . . 4 |- ([y / x]ph <-> ps)
54ralbii 1667 . . 3 |- (A.y e. x [y / x]ph <-> A.y e. x ps)
61, 5syl5ib 206 . 2 |- (x e. On -> (A.y e. x [y / x]ph -> ph))
76tfis 3127 1 |- (x e. On -> ph)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 954   = wceq 956   e. wcel 958  [wsbc 1170  A.wral 1645  Oncon0 2948
This theorem is referenced by:  tfis2 3129  tfr3 3926
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-9 965  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779  ax-un 2866
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3or 776  df-3an 777  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-ral 1649  df-rex 1650  df-rab 1652  df-v 1812  df-sbc 1942  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-tp 2415  df-op 2416  df-uni 2504  df-br 2620  df-opab 2667  df-tr 2681  df-eprel 2832  df-po 2840  df-so 2850  df-fr 2917  df-we 2934  df-ord 2951  df-on 2952
Copyright terms: Public domain