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

Theorem tfrcllembacc 6050
Description: Lemma for tfrcl 6059. Each element of  B is an acceptable function. (Contributed by Jim Kingdon, 25-Mar-2022.)
Hypotheses
Ref Expression
tfrcl.f  |-  F  = recs ( G )
tfrcl.g  |-  ( ph  ->  Fun  G )
tfrcl.x  |-  ( ph  ->  Ord  X )
tfrcl.ex  |-  ( (
ph  /\  x  e.  X  /\  f : x --> S )  ->  ( G `  f )  e.  S )
tfrcllemsucfn.1  |-  A  =  { f  |  E. x  e.  X  (
f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
tfrcllembacc.3  |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u. 
{ <. z ,  ( G `  g )
>. } ) ) }
tfrcllembacc.u  |-  ( (
ph  /\  x  e.  U. X )  ->  suc  x  e.  X )
tfrcllembacc.4  |-  ( ph  ->  D  e.  X )
tfrcllembacc.5  |-  ( ph  ->  A. z  e.  D  E. g ( g : z --> S  /\  A. w  e.  z  (
g `  w )  =  ( G `  ( g  |`  w
) ) ) )
Assertion
Ref Expression
tfrcllembacc  |-  ( ph  ->  B  C_  A )
Distinct variable groups:    A, f, g, h, x, y, z    D, f, g, x, y   
f, G, x, y    S, f, x, y    f, X, x    ph, f, g, h, x, y, z
Allowed substitution hints:    ph( w)    A( w)    B( x, y, z, w, f, g, h)    D( z, w, h)    S( z, w, g, h)    F( x, y, z, w, f, g, h)    G( z, w, g, h)    X( y, z, w, g, h)

Proof of Theorem tfrcllembacc
StepHypRef Expression
1 tfrcllembacc.3 . 2  |-  B  =  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u. 
{ <. z ,  ( G `  g )
>. } ) ) }
2 simpr3 947 . . . . . . 7  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  h  =  ( g  u. 
{ <. z ,  ( G `  g )
>. } ) )
3 tfrcl.f . . . . . . . 8  |-  F  = recs ( G )
4 tfrcl.g . . . . . . . . 9  |-  ( ph  ->  Fun  G )
54ad2antrr 472 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  Fun  G )
6 tfrcl.x . . . . . . . . 9  |-  ( ph  ->  Ord  X )
76ad2antrr 472 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  Ord  X )
8 simp1ll 1002 . . . . . . . . 9  |-  ( ( ( ( ph  /\  z  e.  D )  /\  ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `
 g ) >. } ) ) )  /\  x  e.  X  /\  f : x --> S )  ->  ph )
9 tfrcl.ex . . . . . . . . 9  |-  ( (
ph  /\  x  e.  X  /\  f : x --> S )  ->  ( G `  f )  e.  S )
108, 9syld3an1 1216 . . . . . . . 8  |-  ( ( ( ( ph  /\  z  e.  D )  /\  ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `
 g ) >. } ) ) )  /\  x  e.  X  /\  f : x --> S )  ->  ( G `  f )  e.  S
)
11 tfrcllemsucfn.1 . . . . . . . 8  |-  A  =  { f  |  E. x  e.  X  (
f : x --> S  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
12 tfrcllembacc.4 . . . . . . . . 9  |-  ( ph  ->  D  e.  X )
1312ad2antrr 472 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  D  e.  X )
14 simplr 497 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  z  e.  D )
15 tfrcllembacc.u . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  U. X )  ->  suc  x  e.  X )
1615adantlr 461 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  D )  /\  x  e.  U. X )  ->  suc  x  e.  X )
1716adantlr 461 . . . . . . . 8  |-  ( ( ( ( ph  /\  z  e.  D )  /\  ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `
 g ) >. } ) ) )  /\  x  e.  U. X )  ->  suc  x  e.  X )
18 simpr1 945 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  g : z --> S )
19 simpr2 946 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  g  e.  A )
203, 5, 7, 10, 11, 13, 14, 17, 18, 19tfrcllemsucaccv 6049 . . . . . . 7  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  (
g  u.  { <. z ,  ( G `  g ) >. } )  e.  A )
212, 20eqeltrd 2159 . . . . . 6  |-  ( ( ( ph  /\  z  e.  D )  /\  (
g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) ) )  ->  h  e.  A )
2221ex 113 . . . . 5  |-  ( (
ph  /\  z  e.  D )  ->  (
( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `
 g ) >. } ) )  ->  h  e.  A )
)
2322exlimdv 1742 . . . 4  |-  ( (
ph  /\  z  e.  D )  ->  ( E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u. 
{ <. z ,  ( G `  g )
>. } ) )  ->  h  e.  A )
)
2423rexlimdva 2483 . . 3  |-  ( ph  ->  ( E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  (
g  u.  { <. z ,  ( G `  g ) >. } ) )  ->  h  e.  A ) )
2524abssdv 3079 . 2  |-  ( ph  ->  { h  |  E. z  e.  D  E. g ( g : z --> S  /\  g  e.  A  /\  h  =  ( g  u. 
{ <. z ,  ( G `  g )
>. } ) ) } 
C_  A )
261, 25syl5eqss 3054 1  |-  ( ph  ->  B  C_  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    /\ w3a 920    = wceq 1285   E.wex 1422    e. wcel 1434   {cab 2069   A.wral 2353   E.wrex 2354    u. cun 2982    C_ wss 2984   {csn 3422   <.cop 3425   U.cuni 3627   Ord word 4152   suc csuc 4155    |` cres 4401   Fun wfun 4961   -->wf 4963   ` cfv 4967  recscrecs 5999
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3922  ax-pow 3974  ax-pr 3999  ax-un 4223  ax-setind 4315
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-ral 2358  df-rex 2359  df-v 2614  df-sbc 2827  df-dif 2986  df-un 2988  df-in 2990  df-ss 2997  df-nul 3270  df-pw 3408  df-sn 3428  df-pr 3429  df-op 3431  df-uni 3628  df-br 3812  df-opab 3866  df-tr 3902  df-id 4083  df-iord 4156  df-on 4158  df-suc 4161  df-xp 4405  df-rel 4406  df-cnv 4407  df-co 4408  df-dm 4409  df-rn 4410  df-res 4411  df-iota 4932  df-fun 4969  df-fn 4970  df-f 4971  df-f1 4972  df-fo 4973  df-f1o 4974  df-fv 4975
This theorem is referenced by:  tfrcllembfn  6052  tfrcllemubacc  6054
  Copyright terms: Public domain W3C validator