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

Theorem tfrlem4 6574
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 6572 . . 3  |-  A  =  { g  |  E. z  e.  On  (
g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w
) ) ) }
32abeq2i 2349 . 2  |-  ( g  e.  A  <->  E. z  e.  On  ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w ) ) ) )
4 fnfun 5473 . . . 4  |-  ( g  Fn  z  ->  Fun  g )
54adantr 276 . . 3  |-  ( ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w
) ) )  ->  Fun  g )
65rexlimivw 2664 . 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 1402    e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   Oncon0 4503    |` cres 4771   Fun wfun 5366    Fn wfn 5367   ` cfv 5372
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380
This theorem is referenced by:  tfrlem6  6577
  Copyright terms: Public domain W3C validator