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

Theorem tfrlem4 6459
Description: Lemma for transfinite recursion.  A is the class of all "acceptable" functions, and  F is their union. First we show that an acceptable function is in fact a function. (Contributed by NM, 9-Apr-1995.)
Hypothesis
Ref Expression
tfrlem.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
Assertion
Ref Expression
tfrlem4  |-  ( g  e.  A  ->  Fun  g )
Distinct variable groups:    f, g, x, y, F    A, g
Allowed substitution hints:    A( x, y, f)

Proof of Theorem tfrlem4
Dummy variables  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfrlem.1 . . . 4  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
21tfrlem3 6457 . . 3  |-  A  =  { g  |  E. z  e.  On  (
g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w
) ) ) }
32abeq2i 2340 . 2  |-  ( g  e.  A  <->  E. z  e.  On  ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w ) ) ) )
4 fnfun 5418 . . . 4  |-  ( g  Fn  z  ->  Fun  g )
54adantr 276 . . 3  |-  ( ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w
) ) )  ->  Fun  g )
65rexlimivw 2644 . 2  |-  ( E. z  e.  On  (
g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w
) ) )  ->  Fun  g )
73, 6sylbi 121 1  |-  ( g  e.  A  ->  Fun  g )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1395    e. wcel 2200   {cab 2215   A.wral 2508   E.wrex 2509   Oncon0 4454    |` cres 4721   Fun wfun 5312    Fn wfn 5313   ` cfv 5318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-br 4084  df-opab 4146  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-res 4731  df-iota 5278  df-fun 5320  df-fn 5321  df-fv 5326
This theorem is referenced by:  tfrlem6  6462
  Copyright terms: Public domain W3C validator