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

Theorem tfis2 4335
 Description: Transfinite Induction Schema, using implicit substitution. (Contributed by NM, 18-Aug-1994.)
Hypotheses
Ref Expression
tfis2.1
tfis2.2
Assertion
Ref Expression
tfis2
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem tfis2
StepHypRef Expression
1 nfv 1437 . 2
2 tfis2.1 . 2
3 tfis2.2 . 2
41, 2, 3tfis2f 4334 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 102   wcel 1409  wral 2323  con0 4127 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-setind 4289 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-ral 2328  df-rex 2329  df-rab 2332  df-v 2576  df-in 2951  df-ss 2958  df-uni 3608  df-tr 3882  df-iord 4130  df-on 4132 This theorem is referenced by:  tfis3  4336  tfrlem1  5953  ordiso2  6414
 Copyright terms: Public domain W3C validator