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

Theorem tfrlemibacc 6570
Description: Each element of  B is an acceptable function. Lemma for tfrlemi1 6576. (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 1032 . . . . . . 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 488 . . . . . . . 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 488 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  x  e.  On )
8 simplr 529 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  z  e.  x
)
9 onelon 4510 . . . . . . . . 9  |-  ( ( x  e.  On  /\  z  e.  x )  ->  z  e.  On )
107, 8, 9syl2anc 411 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  z  e.  On )
11 simpr1 1030 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  x )  /\  (
g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) ) )  ->  g  Fn  z
)
12 simpr2 1031 . . . . . . . 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 6569 . . . . . . 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 2311 . . . . . 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 1868 . . . 4  |-  ( (
ph  /\  z  e.  x )  ->  ( E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) )  ->  h  e.  A )
)
1716rexlimdva 2662 . . 3  |-  ( ph  ->  ( E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `  g )
>. } ) )  ->  h  e.  A )
)
1817abssdv 3316 . 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 3288 1  |-  ( ph  ->  B  C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005   A.wal 1396    = wceq 1398   E.wex 1541    e. wcel 2205   {cab 2220   A.wral 2522   E.wrex 2523   _Vcvv 2815    u. cun 3212    C_ wss 3214   {csn 3694   <.cop 3697   Oncon0 4489    |` cres 4756   Fun wfun 5351    Fn wfn 5352   ` cfv 5357
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365
This theorem is referenced by:  tfrlemibfn  6572  tfrlemiubacc  6574
  Copyright terms: Public domain W3C validator