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

Theorem tfrlemi14d 6391
Description: The domain of recs is all ordinals (lemma for transfinite recursion). (Contributed by Jim Kingdon, 9-Jul-2019.)
Hypotheses
Ref Expression
tfrlemi14d.1  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
tfrlemi14d.2  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
Assertion
Ref Expression
tfrlemi14d  |-  ( ph  ->  dom recs ( F )  =  On )
Distinct variable groups:    x, f, y, A    f, F, x, y    ph, f, y
Allowed substitution hint:    ph( x)

Proof of Theorem tfrlemi14d
Dummy variables  g  h  u  w  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfrlemi14d.1 . . . 4  |-  A  =  { f  |  E. x  e.  On  (
f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( F `  ( f  |`  y
) ) ) }
21tfrlem8 6376 . . 3  |-  Ord  dom recs ( F )
3 ordsson 4528 . . 3  |-  ( Ord 
dom recs ( F )  ->  dom recs ( F )  C_  On )
42, 3mp1i 10 . 2  |-  ( ph  ->  dom recs ( F ) 
C_  On )
5 tfrlemi14d.2 . . . . . . . 8  |-  ( ph  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
61, 5tfrlemi1 6390 . . . . . . 7  |-  ( (
ph  /\  z  e.  On )  ->  E. g
( g  Fn  z  /\  A. u  e.  z  ( g `  u
)  =  ( F `
 ( g  |`  u ) ) ) )
75ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  A. x ( Fun 
F  /\  ( F `  x )  e.  _V ) )
8 simplr 528 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  z  e.  On )
9 simprl 529 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  g  Fn  z
)
10 fneq2 5347 . . . . . . . . . . . . 13  |-  ( w  =  z  ->  (
g  Fn  w  <->  g  Fn  z ) )
11 raleq 2693 . . . . . . . . . . . . 13  |-  ( w  =  z  ->  ( A. u  e.  w  ( g `  u
)  =  ( F `
 ( g  |`  u ) )  <->  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u ) ) ) )
1210, 11anbi12d 473 . . . . . . . . . . . 12  |-  ( w  =  z  ->  (
( g  Fn  w  /\  A. u  e.  w  ( g `  u
)  =  ( F `
 ( g  |`  u ) ) )  <-> 
( g  Fn  z  /\  A. u  e.  z  ( g `  u
)  =  ( F `
 ( g  |`  u ) ) ) ) )
1312rspcev 2868 . . . . . . . . . . 11  |-  ( ( z  e.  On  /\  ( g  Fn  z  /\  A. u  e.  z  ( g `  u
)  =  ( F `
 ( g  |`  u ) ) ) )  ->  E. w  e.  On  ( g  Fn  w  /\  A. u  e.  w  ( g `  u )  =  ( F `  ( g  |`  u ) ) ) )
1413adantll 476 . . . . . . . . . 10  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  E. w  e.  On  ( g  Fn  w  /\  A. u  e.  w  ( g `  u
)  =  ( F `
 ( g  |`  u ) ) ) )
15 vex 2766 . . . . . . . . . . 11  |-  g  e. 
_V
161, 15tfrlem3a 6368 . . . . . . . . . 10  |-  ( g  e.  A  <->  E. w  e.  On  ( g  Fn  w  /\  A. u  e.  w  ( g `  u )  =  ( F `  ( g  |`  u ) ) ) )
1714, 16sylibr 134 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  g  e.  A
)
181, 7, 8, 9, 17tfrlemisucaccv 6383 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  ( g  u. 
{ <. z ,  ( F `  g )
>. } )  e.  A
)
19 vex 2766 . . . . . . . . . . . 12  |-  z  e. 
_V
205tfrlem3-2d 6370 . . . . . . . . . . . . 13  |-  ( ph  ->  ( Fun  F  /\  ( F `  g )  e.  _V ) )
2120simprd 114 . . . . . . . . . . . 12  |-  ( ph  ->  ( F `  g
)  e.  _V )
22 opexg 4261 . . . . . . . . . . . 12  |-  ( ( z  e.  _V  /\  ( F `  g )  e.  _V )  ->  <. z ,  ( F `
 g ) >.  e.  _V )
2319, 21, 22sylancr 414 . . . . . . . . . . 11  |-  ( ph  -> 
<. z ,  ( F `
 g ) >.  e.  _V )
24 snidg 3651 . . . . . . . . . . 11  |-  ( <.
z ,  ( F `
 g ) >.  e.  _V  ->  <. z ,  ( F `  g
) >.  e.  { <. z ,  ( F `  g ) >. } )
25 elun2 3331 . . . . . . . . . . 11  |-  ( <.
z ,  ( F `
 g ) >.  e.  { <. z ,  ( F `  g )
>. }  ->  <. z ,  ( F `  g
) >.  e.  ( g  u.  { <. z ,  ( F `  g ) >. } ) )
2623, 24, 253syl 17 . . . . . . . . . 10  |-  ( ph  -> 
<. z ,  ( F `
 g ) >.  e.  ( g  u.  { <. z ,  ( F `
 g ) >. } ) )
2726ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  <. z ,  ( F `  g )
>.  e.  ( g  u. 
{ <. z ,  ( F `  g )
>. } ) )
28 opeldmg 4871 . . . . . . . . . . 11  |-  ( ( z  e.  _V  /\  ( F `  g )  e.  _V )  -> 
( <. z ,  ( F `  g )
>.  e.  ( g  u. 
{ <. z ,  ( F `  g )
>. } )  ->  z  e.  dom  ( g  u. 
{ <. z ,  ( F `  g )
>. } ) ) )
2919, 21, 28sylancr 414 . . . . . . . . . 10  |-  ( ph  ->  ( <. z ,  ( F `  g )
>.  e.  ( g  u. 
{ <. z ,  ( F `  g )
>. } )  ->  z  e.  dom  ( g  u. 
{ <. z ,  ( F `  g )
>. } ) ) )
3029ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  ( <. z ,  ( F `  g ) >.  e.  ( g  u.  { <. z ,  ( F `  g ) >. } )  ->  z  e.  dom  ( g  u.  { <. z ,  ( F `
 g ) >. } ) ) )
3127, 30mpd 13 . . . . . . . 8  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  z  e.  dom  ( g  u.  { <. z ,  ( F `
 g ) >. } ) )
32 dmeq 4866 . . . . . . . . . 10  |-  ( h  =  ( g  u. 
{ <. z ,  ( F `  g )
>. } )  ->  dom  h  =  dom  ( g  u.  { <. z ,  ( F `  g ) >. } ) )
3332eleq2d 2266 . . . . . . . . 9  |-  ( h  =  ( g  u. 
{ <. z ,  ( F `  g )
>. } )  ->  (
z  e.  dom  h  <->  z  e.  dom  ( g  u.  { <. z ,  ( F `  g ) >. } ) ) )
3433rspcev 2868 . . . . . . . 8  |-  ( ( ( g  u.  { <. z ,  ( F `
 g ) >. } )  e.  A  /\  z  e.  dom  ( g  u.  { <. z ,  ( F `
 g ) >. } ) )  ->  E. h  e.  A  z  e.  dom  h )
3518, 31, 34syl2anc 411 . . . . . . 7  |-  ( ( ( ph  /\  z  e.  On )  /\  (
g  Fn  z  /\  A. u  e.  z  ( g `  u )  =  ( F `  ( g  |`  u
) ) ) )  ->  E. h  e.  A  z  e.  dom  h )
366, 35exlimddv 1913 . . . . . 6  |-  ( (
ph  /\  z  e.  On )  ->  E. h  e.  A  z  e.  dom  h )
37 eliun 3920 . . . . . 6  |-  ( z  e.  U_ h  e.  A  dom  h  <->  E. h  e.  A  z  e.  dom  h )
3836, 37sylibr 134 . . . . 5  |-  ( (
ph  /\  z  e.  On )  ->  z  e. 
U_ h  e.  A  dom  h )
3938ex 115 . . . 4  |-  ( ph  ->  ( z  e.  On  ->  z  e.  U_ h  e.  A  dom  h ) )
4039ssrdv 3189 . . 3  |-  ( ph  ->  On  C_  U_ h  e.  A  dom  h )
411recsfval 6373 . . . . 5  |- recs ( F )  =  U. A
4241dmeqi 4867 . . . 4  |-  dom recs ( F )  =  dom  U. A
43 dmuni 4876 . . . 4  |-  dom  U. A  =  U_ h  e.  A  dom  h
4442, 43eqtri 2217 . . 3  |-  dom recs ( F )  =  U_ h  e.  A  dom  h
4540, 44sseqtrrdi 3232 . 2  |-  ( ph  ->  On  C_  dom recs ( F ) )
464, 45eqssd 3200 1  |-  ( ph  ->  dom recs ( F )  =  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1362    = wceq 1364    e. wcel 2167   {cab 2182   A.wral 2475   E.wrex 2476   _Vcvv 2763    u. cun 3155    C_ wss 3157   {csn 3622   <.cop 3625   U.cuni 3839   U_ciun 3916   Ord word 4397   Oncon0 4398   dom cdm 4663    |` cres 4665   Fun wfun 5252    Fn wfn 5253   ` cfv 5258  recscrecs 6362
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-tr 4132  df-id 4328  df-iord 4401  df-on 4403  df-suc 4406  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-recs 6363
This theorem is referenced by:  tfri1d  6393
  Copyright terms: Public domain W3C validator