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

Theorem tfr1onlemubacc 6365
Description: Lemma for tfr1on 6369. 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 6363 . . . . . . . 8  |-  ( ph  ->  U. B  Fn  D
)
11 fndm 5330 . . . . . . . 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 6361 . . . . . . . . . 10  |-  ( ph  ->  B  C_  A )
1413unissd 3848 . . . . . . . . 9  |-  ( ph  ->  U. B  C_  U. A
)
155, 3tfr1onlemssrecs 6358 . . . . . . . . 9  |-  ( ph  ->  U. A  C_ recs ( G ) )
1614, 15sstrd 3180 . . . . . . . 8  |-  ( ph  ->  U. B  C_ recs ( G ) )
17 dmss 4841 . . . . . . . 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, 18eqsstrrd 3207 . . . . . 6  |-  ( ph  ->  D  C_  dom recs ( G ) )
2019sselda 3170 . . . . 5  |-  ( (
ph  /\  w  e.  D )  ->  w  e.  dom recs ( G ) )
21 eqid 2189 . . . . . 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 6338 . . . . 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 6339 . . . . 5  |-  Fun recs ( G )
2512eleq2d 2259 . . . . . 6  |-  ( ph  ->  ( w  e.  dom  U. B  <->  w  e.  D
) )
2625biimpar 297 . . . . 5  |-  ( (
ph  /\  w  e.  D )  ->  w  e.  dom  U. B )
27 funssfv 5556 . . . . 5  |-  ( ( Fun recs ( G )  /\  U. B  C_ recs ( G )  /\  w  e.  dom  U. B )  ->  (recs ( G ) `  w )  =  ( U. B `  w ) )
2824, 16, 26, 27mp3an2ani 1355 . . . 4  |-  ( (
ph  /\  w  e.  D )  ->  (recs ( G ) `  w
)  =  ( U. B `  w )
)
29 ordelon 4398 . . . . . . . . . 10  |-  ( ( Ord  X  /\  D  e.  X )  ->  D  e.  On )
303, 8, 29syl2anc 411 . . . . . . . . 9  |-  ( ph  ->  D  e.  On )
31 eloni 4390 . . . . . . . . 9  |-  ( D  e.  On  ->  Ord  D )
3230, 31syl 14 . . . . . . . 8  |-  ( ph  ->  Ord  D )
33 ordelss 4394 . . . . . . . 8  |-  ( ( Ord  D  /\  w  e.  D )  ->  w  C_  D )
3432, 33sylan 283 . . . . . . 7  |-  ( (
ph  /\  w  e.  D )  ->  w  C_  D )
3512adantr 276 . . . . . . 7  |-  ( (
ph  /\  w  e.  D )  ->  dom  U. B  =  D )
3634, 35sseqtrrd 3209 . . . . . 6  |-  ( (
ph  /\  w  e.  D )  ->  w  C_ 
dom  U. B )
37 fun2ssres 5274 . . . . . 6  |-  ( ( Fun recs ( G )  /\  U. B  C_ recs ( G )  /\  w  C_ 
dom  U. B )  -> 
(recs ( G )  |`  w )  =  ( U. B  |`  w
) )
3824, 16, 36, 37mp3an2ani 1355 . . . . 5  |-  ( (
ph  /\  w  e.  D )  ->  (recs ( G )  |`  w
)  =  ( U. B  |`  w ) )
3938fveq2d 5534 . . . 4  |-  ( (
ph  /\  w  e.  D )  ->  ( G `  (recs ( G )  |`  w
) )  =  ( G `  ( U. B  |`  w ) ) )
4023, 28, 393eqtr3d 2230 . . 3  |-  ( (
ph  /\  w  e.  D )  ->  ( U. B `  w )  =  ( G `  ( U. B  |`  w
) ) )
4140ralrimiva 2563 . 2  |-  ( ph  ->  A. w  e.  D  ( U. B `  w
)  =  ( G `
 ( U. B  |`  w ) ) )
42 fveq2 5530 . . . 4  |-  ( u  =  w  ->  ( U. B `  u )  =  ( U. B `  w ) )
43 reseq2 4917 . . . . 5  |-  ( u  =  w  ->  ( U. B  |`  u )  =  ( U. B  |`  w ) )
4443fveq2d 5534 . . . 4  |-  ( u  =  w  ->  ( G `  ( U. B  |`  u ) )  =  ( G `  ( U. B  |`  w
) ) )
4542, 44eqeq12d 2204 . . 3  |-  ( u  =  w  ->  (
( U. B `  u )  =  ( G `  ( U. B  |`  u ) )  <-> 
( U. B `  w )  =  ( G `  ( U. B  |`  w ) ) ) )
4645cbvralv 2718 . 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 134 1  |-  ( ph  ->  A. u  e.  D  ( U. B `  u
)  =  ( G `
 ( U. B  |`  u ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 980    = wceq 1364   E.wex 1503    e. wcel 2160   {cab 2175   A.wral 2468   E.wrex 2469   _Vcvv 2752    u. cun 3142    C_ wss 3144   {csn 3607   <.cop 3610   U.cuni 3824   Ord word 4377   Oncon0 4378   suc csuc 4380   dom cdm 4641    |` cres 4643   Fun wfun 5225    Fn wfn 5226   ` cfv 5231  recscrecs 6323
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-ral 2473  df-rex 2474  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-id 4308  df-iord 4381  df-on 4383  df-suc 4386  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-iota 5193  df-fun 5233  df-fn 5234  df-f 5235  df-fv 5239  df-recs 6324
This theorem is referenced by:  tfr1onlemex  6366
  Copyright terms: Public domain W3C validator