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

Theorem tfrlemiubacc 6344
Description: The union of  B satisfies the recursion rule (lemma for tfrlemi1 6346). (Contributed by Jim Kingdon, 22-Apr-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
tfrlemiubacc  |-  ( ph  ->  A. u  e.  x  ( U. B `  u
)  =  ( F `
 ( U. B  |`  u ) ) )
Distinct variable groups:    f, g, h, u, w, x, y, z, A    f, F, g, h, u, w, x, y, z    ph, w, y    u, B, w, f, g, h, z    ph, g, h, z
Allowed substitution hints:    ph( x, u, f)    B( x, y)

Proof of Theorem tfrlemiubacc
StepHypRef Expression
1 tfrlemisucfn.1 . . . . . . . . 9  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
2 tfrlemisucfn.2 . . . . . . . . 9  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
3 tfrlemi1.3 . . . . . . . . 9  |-  B  =  { h  |  E. z  e.  x  E. g ( g  Fn  z  /\  g  e.  A  /\  h  =  ( g  u.  { <. z ,  ( F `
 g ) >. } ) ) }
4 tfrlemi1.4 . . . . . . . . 9  |-  ( ph  ->  x  e.  On )
5 tfrlemi1.5 . . . . . . . . 9  |-  ( ph  ->  A. z  e.  x  E. g ( g  Fn  z  /\  A. w  e.  z  ( g `  w )  =  ( F `  ( g  |`  w ) ) ) )
61, 2, 3, 4, 5tfrlemibfn 6342 . . . . . . . 8  |-  ( ph  ->  U. B  Fn  x
)
7 fndm 5327 . . . . . . . 8  |-  ( U. B  Fn  x  ->  dom  U. B  =  x
)
86, 7syl 14 . . . . . . 7  |-  ( ph  ->  dom  U. B  =  x )
91, 2, 3, 4, 5tfrlemibacc 6340 . . . . . . . . . 10  |-  ( ph  ->  B  C_  A )
109unissd 3845 . . . . . . . . 9  |-  ( ph  ->  U. B  C_  U. A
)
111recsfval 6329 . . . . . . . . 9  |- recs ( F )  =  U. A
1210, 11sseqtrrdi 3216 . . . . . . . 8  |-  ( ph  ->  U. B  C_ recs ( F ) )
13 dmss 4838 . . . . . . . 8  |-  ( U. B  C_ recs ( F )  ->  dom  U. B  C_  dom recs ( F ) )
1412, 13syl 14 . . . . . . 7  |-  ( ph  ->  dom  U. B  C_  dom recs ( F ) )
158, 14eqsstrrd 3204 . . . . . 6  |-  ( ph  ->  x  C_  dom recs ( F ) )
1615sselda 3167 . . . . 5  |-  ( (
ph  /\  w  e.  x )  ->  w  e.  dom recs ( F ) )
171tfrlem9 6333 . . . . 5  |-  ( w  e.  dom recs ( F
)  ->  (recs ( F ) `  w
)  =  ( F `
 (recs ( F )  |`  w )
) )
1816, 17syl 14 . . . 4  |-  ( (
ph  /\  w  e.  x )  ->  (recs ( F ) `  w
)  =  ( F `
 (recs ( F )  |`  w )
) )
191tfrlem7 6331 . . . . . 6  |-  Fun recs ( F )
2019a1i 9 . . . . 5  |-  ( (
ph  /\  w  e.  x )  ->  Fun recs ( F ) )
2112adantr 276 . . . . 5  |-  ( (
ph  /\  w  e.  x )  ->  U. B  C_ recs
( F ) )
228eleq2d 2257 . . . . . 6  |-  ( ph  ->  ( w  e.  dom  U. B  <->  w  e.  x
) )
2322biimpar 297 . . . . 5  |-  ( (
ph  /\  w  e.  x )  ->  w  e.  dom  U. B )
24 funssfv 5553 . . . . 5  |-  ( ( Fun recs ( F )  /\  U. B  C_ recs ( F )  /\  w  e.  dom  U. B )  ->  (recs ( F ) `  w )  =  ( U. B `  w ) )
2520, 21, 23, 24syl3anc 1248 . . . 4  |-  ( (
ph  /\  w  e.  x )  ->  (recs ( F ) `  w
)  =  ( U. B `  w )
)
26 eloni 4387 . . . . . . . . 9  |-  ( x  e.  On  ->  Ord  x )
274, 26syl 14 . . . . . . . 8  |-  ( ph  ->  Ord  x )
28 ordelss 4391 . . . . . . . 8  |-  ( ( Ord  x  /\  w  e.  x )  ->  w  C_  x )
2927, 28sylan 283 . . . . . . 7  |-  ( (
ph  /\  w  e.  x )  ->  w  C_  x )
308adantr 276 . . . . . . 7  |-  ( (
ph  /\  w  e.  x )  ->  dom  U. B  =  x )
3129, 30sseqtrrd 3206 . . . . . 6  |-  ( (
ph  /\  w  e.  x )  ->  w  C_ 
dom  U. B )
32 fun2ssres 5271 . . . . . 6  |-  ( ( Fun recs ( F )  /\  U. B  C_ recs ( F )  /\  w  C_ 
dom  U. B )  -> 
(recs ( F )  |`  w )  =  ( U. B  |`  w
) )
3320, 21, 31, 32syl3anc 1248 . . . . 5  |-  ( (
ph  /\  w  e.  x )  ->  (recs ( F )  |`  w
)  =  ( U. B  |`  w ) )
3433fveq2d 5531 . . . 4  |-  ( (
ph  /\  w  e.  x )  ->  ( F `  (recs ( F )  |`  w
) )  =  ( F `  ( U. B  |`  w ) ) )
3518, 25, 343eqtr3d 2228 . . 3  |-  ( (
ph  /\  w  e.  x )  ->  ( U. B `  w )  =  ( F `  ( U. B  |`  w
) ) )
3635ralrimiva 2560 . 2  |-  ( ph  ->  A. w  e.  x  ( U. B `  w
)  =  ( F `
 ( U. B  |`  w ) ) )
37 fveq2 5527 . . . 4  |-  ( u  =  w  ->  ( U. B `  u )  =  ( U. B `  w ) )
38 reseq2 4914 . . . . 5  |-  ( u  =  w  ->  ( U. B  |`  u )  =  ( U. B  |`  w ) )
3938fveq2d 5531 . . . 4  |-  ( u  =  w  ->  ( F `  ( U. B  |`  u ) )  =  ( F `  ( U. B  |`  w
) ) )
4037, 39eqeq12d 2202 . . 3  |-  ( u  =  w  ->  (
( U. B `  u )  =  ( F `  ( U. B  |`  u ) )  <-> 
( U. B `  w )  =  ( F `  ( U. B  |`  w ) ) ) )
4140cbvralv 2715 . 2  |-  ( A. u  e.  x  ( U. B `  u )  =  ( F `  ( U. B  |`  u
) )  <->  A. w  e.  x  ( U. B `  w )  =  ( F `  ( U. B  |`  w
) ) )
4236, 41sylibr 134 1  |-  ( ph  ->  A. u  e.  x  ( U. B `  u
)  =  ( F `
 ( U. B  |`  u ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 979   A.wal 1361    = wceq 1363   E.wex 1502    e. wcel 2158   {cab 2173   A.wral 2465   E.wrex 2466   _Vcvv 2749    u. cun 3139    C_ wss 3141   {csn 3604   <.cop 3607   U.cuni 3821   Ord word 4374   Oncon0 4375   dom cdm 4638    |` cres 4640   Fun wfun 5222    Fn wfn 5223   ` cfv 5228  recscrecs 6318
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 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-13 2160  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221  ax-un 4445  ax-setind 4548
This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-fal 1369  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ne 2358  df-ral 2470  df-rex 2471  df-rab 2474  df-v 2751  df-sbc 2975  df-csb 3070  df-dif 3143  df-un 3145  df-in 3147  df-ss 3154  df-nul 3435  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-uni 3822  df-iun 3900  df-br 4016  df-opab 4077  df-mpt 4078  df-tr 4114  df-id 4305  df-iord 4378  df-on 4380  df-suc 4383  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-rn 4649  df-res 4650  df-iota 5190  df-fun 5230  df-fn 5231  df-f 5232  df-fv 5236  df-recs 6319
This theorem is referenced by:  tfrlemiex  6345
  Copyright terms: Public domain W3C validator