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

Theorem tfrlemibacc 6587
Description: Each element of  B is an acceptable function. Lemma for tfrlemi1 6593. (Contributed by Jim Kingdon, 14-Mar-2019.) (Proof shortened by Mario Carneiro, 24-May-2019.)
Hypotheses
Ref Expression
tfrlemisucfn.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
tfrlemisucfn.2  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
tfrlemi1.3  |-  B  =  { h  |  E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) ) }
tfrlemi1.4  |-  ( ph  ->  x  e.  On )
tfrlemi1.5  |-  ( ph  ->  A. z  e.  x  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w ) ) ) )
Assertion
Ref Expression
tfrlemibacc  |-  ( ph  ->  B  C_  A )
Distinct variable groups:    f, g, h, w, x, y, z, A    f, F, g, h, w, x, y, z    ph, w, y    w, B, f, g, h, z    ph, g, h, z
Allowed substitution hints:    ph( x, f)    B( x, y)

Proof of Theorem tfrlemibacc
StepHypRef Expression
1 tfrlemi1.3 . 2  |-  B  =  { h  |  E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) ) }
2 simpr3 1036 . . . . . . 7  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  h  =  ( g  u.  { <. z ,  ( F `  g ) >. } ) )
3 tfrlemisucfn.1 . . . . . . . 8  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
4 tfrlemisucfn.2 . . . . . . . . 9  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
54ad2antrr 492 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
6 tfrlemi1.4 . . . . . . . . . 10  |-  ( ph  ->  x  e.  On )
76ad2antrr 492 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  x  e.  On )
8 simplr 533 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  z  e.  x
)
9 onelon 4524 . . . . . . . . 9  |-  ( ( x  e.  On  /\  z  e.  x )  ->  z  e.  On )
107, 8, 9syl2anc 415 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  z  e.  On )
11 simpr1 1034 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  g  Fn  z
)
12 simpr2 1035 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  g  e.  A
)
133, 5, 10, 11, 12tfrlemisucaccv 6586 . . . . . . 7  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  ( g  u. 
{ <. z ,  ( F `  g )
>. } )  e.  A
)
142, 13eqeltrd 2315 . . . . . 6  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  h  e.  A
)
1514ex 115 . . . . 5  |-  ( (
ph  /\  z  e.  x )  ->  (
( g  Fn  z  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( F `  g ) >. } ) )  ->  h  e.  A ) )
1615exlimdv 1872 . . . 4  |-  ( (
ph  /\  z  e.  x )  ->  ( E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) )  ->  h  e.  A )
)
1716rexlimdva 2668 . . 3  |-  ( ph  ->  ( E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) )  ->  h  e.  A )
)
1817abssdv 3322 . 2  |-  ( ph  ->  { h  |  E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) ) } 
C_  A )
191, 18eqsstrid 3294 1  |-  ( ph  ->  B  C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1009   A.wal 1400    = wceq 1402   E.wex 1545    e. wcel 2209   {cab 2224   A.wral 2528   E.wrex 2529   _Vcvv 2821    u. cun 3218    C_ wss 3220   {csn 3705   <.cop 3708   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-in1 623  ax-in2 624  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-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  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:  tfrlemibfn  6589  tfrlemiubacc  6591
  Copyright terms: Public domain W3C validator