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

Theorem tfr1onlemubacc 6058
Description: Lemma for tfr1on 6062. The union of  B satisfies the recursion rule. (Contributed by Jim Kingdon, 15-Mar-2022.)
Hypotheses
Ref Expression
tfr1on.f  |-  F  = recs ( G )
tfr1on.g  |-  ( ph  ->  Fun  G )
tfr1on.x  |-  ( ph  ->  Ord  X )
tfr1on.ex  |-  ( (
ph  /\  x  e.  X  /\  f  Fn  x
)  ->  ( G `  f )  e.  _V )
tfr1onlemsucfn.1  |-  A  =  { f  |  E. x  e.  X  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
tfr1onlembacc.3  |-  B  =  { h  |  E. z  e.  D  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `
 g ) >. } ) ) }
tfr1onlembacc.u  |-  ( (
ph  /\  x  e.  U. X )  ->  suc  x  e.  X )
tfr1onlembacc.4  |-  ( ph  ->  D  e.  X )
tfr1onlembacc.5  |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )
Assertion
Ref Expression
tfr1onlemubacc  |-  ( ph  ->  A. u  e.  D  ( U. B `  u
)  =  ( G `
 ( U. B  |`  u ) ) )
Distinct variable groups:    A, f, g, h, x, z    D, f, g, x    f, G, x, y    f, X, x    ph, f, g, h, x, z    y, g, z    B, g, h, w, z    u, B, w    D, h, w, z, f, x    u, D    h, G, z, y    u, G, w    g, X, z    ph, w    y, w
Allowed substitution hints:    ph( y, u)    A( y, w, u)    B( x, y, f)    D( y)    F( x, y, z, w, u, f, g, h)    G( g)    X( y, w, u, h)

Proof of Theorem tfr1onlemubacc
StepHypRef Expression
1 tfr1on.f . . . . . . . . 9  |-  F  = recs ( G )
2 tfr1on.g . . . . . . . . 9  |-  ( ph  ->  Fun  G )
3 tfr1on.x . . . . . . . . 9  |-  ( ph  ->  Ord  X )
4 tfr1on.ex . . . . . . . . 9  |-  ( (
ph  /\  x  e.  X  /\  f  Fn  x
)  ->  ( G `  f )  e.  _V )
5 tfr1onlemsucfn.1 . . . . . . . . 9  |-  A  =  { f  |  E. x  e.  X  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y
) ) ) }
6 tfr1onlembacc.3 . . . . . . . . 9  |-  B  =  { h  |  E. z  e.  D  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( G `
 g ) >. } ) ) }
7 tfr1onlembacc.u . . . . . . . . 9  |-  ( (
ph  /\  x  e.  U. X )  ->  suc  x  e.  X )
8 tfr1onlembacc.4 . . . . . . . . 9  |-  ( ph  ->  D  e.  X )
9 tfr1onlembacc.5 . . . . . . . . 9  |-  ( ph  ->  A. z  e.  D  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( G `  ( g  |`  w ) ) ) )
101, 2, 3, 4, 5, 6, 7, 8, 9tfr1onlembfn 6056 . . . . . . . 8  |-  ( ph  ->  U. B  Fn  D
)
11 fndm 5074 . . . . . . . 8  |-  ( U. B  Fn  D  ->  dom  U. B  =  D
)
1210, 11syl 14 . . . . . . 7  |-  ( ph  ->  dom  U. B  =  D )
131, 2, 3, 4, 5, 6, 7, 8, 9tfr1onlembacc 6054 . . . . . . . . . 10  |-  ( ph  ->  B  C_  A )
1413unissd 3659 . . . . . . . . 9  |-  ( ph  ->  U. B  C_  U. A
)
155, 3tfr1onlemssrecs 6051 . . . . . . . . 9  |-  ( ph  ->  U. A  C_ recs ( G ) )
1614, 15sstrd 3024 . . . . . . . 8  |-  ( ph  ->  U. B  C_ recs ( G ) )
17 dmss 4601 . . . . . . . 8  |-  ( U. B  C_ recs ( G )  ->  dom  U. B  C_  dom recs ( G ) )
1816, 17syl 14 . . . . . . 7  |-  ( ph  ->  dom  U. B  C_  dom recs ( G ) )
1912, 18eqsstr3d 3050 . . . . . 6  |-  ( ph  ->  D  C_  dom recs ( G ) )
2019sselda 3014 . . . . 5  |-  ( (
ph  /\  w  e.  D )  ->  w  e.  dom recs ( G ) )
21 eqid 2085 . . . . . 6  |-  { f  |  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }  =  { f  |  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }
2221tfrlem9 6031 . . . . 5  |-  ( w  e.  dom recs ( G
)  ->  (recs ( G ) `  w
)  =  ( G `
 (recs ( G )  |`  w )
) )
2320, 22syl 14 . . . 4  |-  ( (
ph  /\  w  e.  D )  ->  (recs ( G ) `  w
)  =  ( G `
 (recs ( G )  |`  w )
) )
24 tfrfun 6032 . . . . 5  |-  Fun recs ( G )
2512eleq2d 2154 . . . . . 6  |-  ( ph  ->  ( w  e.  dom  U. B  <->  w  e.  D
) )
2625biimpar 291 . . . . 5  |-  ( (
ph  /\  w  e.  D )  ->  w  e.  dom  U. B )
27 funssfv 5286 . . . . 5  |-  ( ( Fun recs ( G )  /\  U. B  C_ recs ( G )  /\  w  e.  dom  U. B )  ->  (recs ( G ) `  w )  =  ( U. B `  w ) )
2824, 16, 26, 27mp3an2ani 1278 . . . 4  |-  ( (
ph  /\  w  e.  D )  ->  (recs ( G ) `  w
)  =  ( U. B `  w )
)
29 ordelon 4182 . . . . . . . . . 10  |-  ( ( Ord  X  /\  D  e.  X )  ->  D  e.  On )
303, 8, 29syl2anc 403 . . . . . . . . 9  |-  ( ph  ->  D  e.  On )
31 eloni 4174 . . . . . . . . 9  |-  ( D  e.  On  ->  Ord  D )
3230, 31syl 14 . . . . . . . 8  |-  ( ph  ->  Ord  D )
33 ordelss 4178 . . . . . . . 8  |-  ( ( Ord  D  /\  w  e.  D )  ->  w  C_  D )
3432, 33sylan 277 . . . . . . 7  |-  ( (
ph  /\  w  e.  D )  ->  w  C_  D )
3512adantr 270 . . . . . . 7  |-  ( (
ph  /\  w  e.  D )  ->  dom  U. B  =  D )
3634, 35sseqtr4d 3052 . . . . . 6  |-  ( (
ph  /\  w  e.  D )  ->  w  C_ 
dom  U. B )
37 fun2ssres 5018 . . . . . 6  |-  ( ( Fun recs ( G )  /\  U. B  C_ recs ( G )  /\  w  C_ 
dom  U. B )  -> 
(recs ( G )  |`  w )  =  ( U. B  |`  w
) )
3824, 16, 36, 37mp3an2ani 1278 . . . . 5  |-  ( (
ph  /\  w  e.  D )  ->  (recs ( G )  |`  w
)  =  ( U. B  |`  w ) )
3938fveq2d 5265 . . . 4  |-  ( (
ph  /\  w  e.  D )  ->  ( G `  (recs ( G )  |`  w
) )  =  ( G `  ( U. B  |`  w ) ) )
4023, 28, 393eqtr3d 2125 . . 3  |-  ( (
ph  /\  w  e.  D )  ->  ( U. B `  w )  =  ( G `  ( U. B  |`  w
) ) )
4140ralrimiva 2442 . 2  |-  ( ph  ->  A. w  e.  D  ( U. B `  w
)  =  ( G `
 ( U. B  |`  w ) ) )
42 fveq2 5261 . . . 4  |-  ( u  =  w  ->  ( U. B `  u )  =  ( U. B `  w ) )
43 reseq2 4674 . . . . 5  |-  ( u  =  w  ->  ( U. B  |`  u )  =  ( U. B  |`  w ) )
4443fveq2d 5265 . . . 4  |-  ( u  =  w  ->  ( G `  ( U. B  |`  u ) )  =  ( G `  ( U. B  |`  w
) ) )
4542, 44eqeq12d 2099 . . 3  |-  ( u  =  w  ->  (
( U. B `  u )  =  ( G `  ( U. B  |`  u ) )  <-> 
( U. B `  w )  =  ( G `  ( U. B  |`  w ) ) ) )
4645cbvralv 2586 . 2  |-  ( A. u  e.  D  ( U. B `  u )  =  ( G `  ( U. B  |`  u
) )  <->  A. w  e.  D  ( U. B `  w )  =  ( G `  ( U. B  |`  w
) ) )
4741, 46sylibr 132 1  |-  ( ph  ->  A. u  e.  D  ( U. B `  u
)  =  ( G `
 ( U. B  |`  u ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    /\ w3a 922    = wceq 1287   E.wex 1424    e. wcel 1436   {cab 2071   A.wral 2355   E.wrex 2356   _Vcvv 2615    u. cun 2986    C_ wss 2988   {csn 3430   <.cop 3433   U.cuni 3635   Ord word 4161   Oncon0 4162   suc csuc 4164   dom cdm 4409    |` cres 4411   Fun wfun 4971    Fn wfn 4972   ` cfv 4977  recscrecs 6016
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 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-10 1439  ax-11 1440  ax-i12 1441  ax-bndl 1442  ax-4 1443  ax-13 1447  ax-14 1448  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067  ax-sep 3930  ax-pow 3982  ax-pr 4008  ax-un 4232  ax-setind 4324
This theorem depends on definitions:  df-bi 115  df-3an 924  df-tru 1290  df-fal 1293  df-nf 1393  df-sb 1690  df-eu 1948  df-mo 1949  df-clab 2072  df-cleq 2078  df-clel 2081  df-nfc 2214  df-ne 2252  df-ral 2360  df-rex 2361  df-rab 2364  df-v 2617  df-sbc 2830  df-csb 2923  df-dif 2990  df-un 2992  df-in 2994  df-ss 3001  df-nul 3276  df-pw 3416  df-sn 3436  df-pr 3437  df-op 3439  df-uni 3636  df-iun 3714  df-br 3820  df-opab 3874  df-mpt 3875  df-tr 3910  df-id 4092  df-iord 4165  df-on 4167  df-suc 4170  df-xp 4415  df-rel 4416  df-cnv 4417  df-co 4418  df-dm 4419  df-rn 4420  df-res 4421  df-iota 4942  df-fun 4979  df-fn 4980  df-f 4981  df-fv 4985  df-recs 6017
This theorem is referenced by:  tfr1onlemex  6059
  Copyright terms: Public domain W3C validator