ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  tfis3 Unicode version

Theorem tfis3 4468
Description: Transfinite Induction Schema, using implicit substitution. (Contributed by NM, 4-Nov-2003.)
Hypotheses
Ref Expression
tfis3.1  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
tfis3.2  |-  ( x  =  A  ->  ( ph 
<->  ch ) )
tfis3.3  |-  ( x  e.  On  ->  ( A. y  e.  x  ps  ->  ph ) )
Assertion
Ref Expression
tfis3  |-  ( A  e.  On  ->  ch )
Distinct variable groups:    ps, x    ph, y    ch, x    x, A    x, y
Allowed substitution hints:    ph( x)    ps( y)    ch( y)    A( y)

Proof of Theorem tfis3
StepHypRef Expression
1 tfis3.2 . 2  |-  ( x  =  A  ->  ( ph 
<->  ch ) )
2 tfis3.1 . . 3  |-  ( x  =  y  ->  ( ph 
<->  ps ) )
3 tfis3.3 . . 3  |-  ( x  e.  On  ->  ( A. y  e.  x  ps  ->  ph ) )
42, 3tfis2 4467 . 2  |-  ( x  e.  On  ->  ph )
51, 4vtoclga 2724 1  |-  ( A  e.  On  ->  ch )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1314    e. wcel 1463   A.wral 2391   Oncon0 4253
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-setind 4420
This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2245  df-ral 2396  df-rex 2397  df-rab 2400  df-v 2660  df-in 3045  df-ss 3052  df-uni 3705  df-tr 3995  df-iord 4256  df-on 4258
This theorem is referenced by:  tfisi  4469  tfrlemi1  6195  tfr1onlemaccex  6211  tfrcllemaccex  6224  tfrcl  6227
  Copyright terms: Public domain W3C validator