MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tfis2 Structured version   Unicode version

Theorem tfis2 6466
Description: Transfinite Induction Schema, using implicit substitution. (Contributed by NM, 18-Aug-1994.)
Hypotheses
Ref Expression
tfis2.1  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
tfis2.2  |-  ( x  e.  On  ->  ( A. y  e.  x  ps  ->  ph ) )
Assertion
Ref Expression
tfis2  |-  ( x  e.  On  ->  ph )
Distinct variable groups:    ps, x    ph, y    x, y
Allowed substitution hints:    ph( x)    ps( y)

Proof of Theorem tfis2
StepHypRef Expression
1 nfv 1673 . 2  |-  F/ x ps
2 tfis2.1 . 2  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
3 tfis2.2 . 2  |-  ( x  e.  On  ->  ( A. y  e.  x  ps  ->  ph ) )
41, 2, 3tfis2f 6465 1  |-  ( x  e.  On  ->  ph )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    e. wcel 1756   A.wral 2714   Oncon0 4718
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4412  ax-nul 4420  ax-pr 4530  ax-un 6371
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2429  df-cleq 2435  df-clel 2438  df-nfc 2567  df-ne 2607  df-ral 2719  df-rex 2720  df-rab 2723  df-v 2973  df-sbc 3186  df-dif 3330  df-un 3332  df-in 3334  df-ss 3341  df-pss 3343  df-nul 3637  df-if 3791  df-sn 3877  df-pr 3879  df-tp 3881  df-op 3883  df-uni 4091  df-br 4292  df-opab 4350  df-tr 4385  df-eprel 4631  df-po 4640  df-so 4641  df-fr 4678  df-we 4680  df-ord 4721  df-on 4722
This theorem is referenced by:  tfis3  6467  smogt  6827  tfrlem1  6834  findcard3  7554  ordiso2  7728  cantnf  7900  cantnfOLD  7922  cfsmolem  8438  fpwwe2lem8  8803  nqereu  9097
  Copyright terms: Public domain W3C validator