MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tfrlem12 Unicode version

Theorem tfrlem12 6401
Description: Lemma for transfinite recursion. Show  C is an acceptable function. (Contributed by NM, 15-Aug-1994.) (Revised by Mario Carneiro, 9-May-2015.)
Hypotheses
Ref Expression
tfrlem.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
tfrlem.3  |-  C  =  (recs ( F )  u.  { <.  dom recs ( F ) ,  ( F ` recs ( F
) ) >. } )
Assertion
Ref Expression
tfrlem12  |-  (recs ( F )  e.  _V  ->  C  e.  A )
Distinct variable groups:    x, f,
y, C    f, F, x, y
Allowed substitution hints:    A( x, y, f)

Proof of Theorem tfrlem12
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 tfrlem.1 . . . . . 6  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
21tfrlem8 6396 . . . . 5  |-  Ord  dom recs ( F )
32a1i 10 . . . 4  |-  (recs ( F )  e.  _V  ->  Ord  dom recs ( F
) )
4 dmexg 4938 . . . 4  |-  (recs ( F )  e.  _V  ->  dom recs ( F )  e.  _V )
5 elon2 4402 . . . 4  |-  (  dom recs
( F )  e.  On  <->  ( Ord  dom recs ( F )  /\  dom recs ( F )  e.  _V ) )
63, 4, 5sylanbrc 645 . . 3  |-  (recs ( F )  e.  _V  ->  dom recs ( F )  e.  On )
7 suceloni 4603 . . . 4  |-  (  dom recs
( F )  e.  On  ->  suc  dom recs ( F )  e.  On )
8 tfrlem.3 . . . . 5  |-  C  =  (recs ( F )  u.  { <.  dom recs ( F ) ,  ( F ` recs ( F
) ) >. } )
91, 8tfrlem10 6399 . . . 4  |-  (  dom recs
( F )  e.  On  ->  C  Fn  suc  dom recs ( F ) )
101, 8tfrlem11 6400 . . . . . 6  |-  (  dom recs
( F )  e.  On  ->  ( z  e.  suc  dom recs ( F
)  ->  ( C `  z )  =  ( F `  ( C  |`  z ) ) ) )
1110ralrimiv 2626 . . . . 5  |-  (  dom recs
( F )  e.  On  ->  A. z  e.  suc  dom recs ( F
) ( C `  z )  =  ( F `  ( C  |`  z ) ) )
12 fveq2 5486 . . . . . . 7  |-  ( z  =  y  ->  ( C `  z )  =  ( C `  y ) )
13 reseq2 4949 . . . . . . . 8  |-  ( z  =  y  ->  ( C  |`  z )  =  ( C  |`  y
) )
1413fveq2d 5490 . . . . . . 7  |-  ( z  =  y  ->  ( F `  ( C  |`  z ) )  =  ( F `  ( C  |`  y ) ) )
1512, 14eqeq12d 2298 . . . . . 6  |-  ( z  =  y  ->  (
( C `  z
)  =  ( F `
 ( C  |`  z ) )  <->  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) )
1615cbvralv 2765 . . . . 5  |-  ( A. z  e.  suc  dom recs ( F ) ( C `
 z )  =  ( F `  ( C  |`  z ) )  <->  A. y  e.  suc  dom recs
( F ) ( C `  y )  =  ( F `  ( C  |`  y ) ) )
1711, 16sylib 188 . . . 4  |-  (  dom recs
( F )  e.  On  ->  A. y  e.  suc  dom recs ( F
) ( C `  y )  =  ( F `  ( C  |`  y ) ) )
18 fneq2 5300 . . . . . 6  |-  ( x  =  suc  dom recs ( F )  ->  ( C  Fn  x  <->  C  Fn  suc  dom recs ( F ) ) )
19 raleq 2737 . . . . . 6  |-  ( x  =  suc  dom recs ( F )  ->  ( A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) )  <->  A. y  e.  suc  dom recs
( F ) ( C `  y )  =  ( F `  ( C  |`  y ) ) ) )
2018, 19anbi12d 691 . . . . 5  |-  ( x  =  suc  dom recs ( F )  ->  (
( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) )  <->  ( C  Fn  suc  dom recs ( F
)  /\  A. y  e.  suc  dom recs ( F
) ( C `  y )  =  ( F `  ( C  |`  y ) ) ) ) )
2120rspcev 2885 . . . 4  |-  ( ( suc  dom recs ( F
)  e.  On  /\  ( C  Fn  suc  dom recs
( F )  /\  A. y  e.  suc  dom recs ( F ) ( C `
 y )  =  ( F `  ( C  |`  y ) ) ) )  ->  E. x  e.  On  ( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) )
227, 9, 17, 21syl12anc 1180 . . 3  |-  (  dom recs
( F )  e.  On  ->  E. x  e.  On  ( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) )
236, 22syl 15 . 2  |-  (recs ( F )  e.  _V  ->  E. x  e.  On  ( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) )
24 snex 4215 . . . . 5  |-  { <.  dom recs
( F ) ,  ( F ` recs ( F ) ) >. }  e.  _V
25 unexg 4520 . . . . 5  |-  ( (recs ( F )  e. 
_V  /\  { <.  dom recs ( F ) ,  ( F ` recs ( F
) ) >. }  e.  _V )  ->  (recs ( F )  u.  { <.  dom recs ( F ) ,  ( F ` recs ( F ) ) >. } )  e.  _V )
2624, 25mpan2 652 . . . 4  |-  (recs ( F )  e.  _V  ->  (recs ( F )  u.  { <.  dom recs ( F ) ,  ( F ` recs ( F
) ) >. } )  e.  _V )
278, 26syl5eqel 2368 . . 3  |-  (recs ( F )  e.  _V  ->  C  e.  _V )
28 fneq1 5299 . . . . . 6  |-  ( f  =  C  ->  (
f  Fn  x  <->  C  Fn  x ) )
29 fveq1 5485 . . . . . . . 8  |-  ( f  =  C  ->  (
f `  y )  =  ( C `  y ) )
30 reseq1 4948 . . . . . . . . 9  |-  ( f  =  C  ->  (
f  |`  y )  =  ( C  |`  y
) )
3130fveq2d 5490 . . . . . . . 8  |-  ( f  =  C  ->  ( F `  ( f  |`  y ) )  =  ( F `  ( C  |`  y ) ) )
3229, 31eqeq12d 2298 . . . . . . 7  |-  ( f  =  C  ->  (
( f `  y
)  =  ( F `
 ( f  |`  y ) )  <->  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) )
3332ralbidv 2564 . . . . . 6  |-  ( f  =  C  ->  ( A. y  e.  x  ( f `  y
)  =  ( F `
 ( f  |`  y ) )  <->  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) )
3428, 33anbi12d 691 . . . . 5  |-  ( f  =  C  ->  (
( f  Fn  x  /\  A. y  e.  x  ( f `  y
)  =  ( F `
 ( f  |`  y ) ) )  <-> 
( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) ) )
3534rexbidv 2565 . . . 4  |-  ( f  =  C  ->  ( E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y
)  =  ( F `
 ( f  |`  y ) ) )  <->  E. x  e.  On  ( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) ) )
3635, 1elab2g 2917 . . 3  |-  ( C  e.  _V  ->  ( C  e.  A  <->  E. x  e.  On  ( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) ) )
3727, 36syl 15 . 2  |-  (recs ( F )  e.  _V  ->  ( C  e.  A  <->  E. x  e.  On  ( C  Fn  x  /\  A. y  e.  x  ( C `  y )  =  ( F `  ( C  |`  y ) ) ) ) )
3823, 37mpbird 223 1  |-  (recs ( F )  e.  _V  ->  C  e.  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1685   {cab 2270   A.wral 2544   E.wrex 2545   _Vcvv 2789    u. cun 3151   {csn 3641   <.cop 3644   Ord word 4390   Oncon0 4391   suc csuc 4393    dom cdm 4688    |` cres 4690    Fn wfn 5216   ` cfv 5221  recscrecs 6383
This theorem is referenced by:  tfrlem13  6402
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-13 1687  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265  ax-sep 4142  ax-nul 4150  ax-pr 4213  ax-un 4511
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-rab 2553  df-v 2791  df-sbc 2993  df-csb 3083  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-pss 3169  df-nul 3457  df-if 3567  df-sn 3647  df-pr 3648  df-tp 3649  df-op 3650  df-uni 3829  df-iun 3908  df-br 4025  df-opab 4079  df-mpt 4080  df-tr 4115  df-eprel 4304  df-id 4308  df-po 4313  df-so 4314  df-fr 4351  df-we 4353  df-ord 4394  df-on 4395  df-suc 4397  df-xp 4694  df-rel 4695  df-cnv 4696  df-co 4697  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701  df-fun 5223  df-fn 5224  df-fv 5229  df-recs 6384
  Copyright terms: Public domain W3C validator