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

Theorem frecfnom 6566
Description: The function generated by finite recursive definition generation is a function on omega. (Contributed by Jim Kingdon, 13-May-2020.)
Assertion
Ref Expression
frecfnom  |-  ( ( A. z ( F `
 z )  e. 
_V  /\  A  e.  V )  -> frec ( F ,  A )  Fn 
om )
Distinct variable groups:    z, A    z, F
Allowed substitution hint:    V( z)

Proof of Theorem frecfnom
Dummy variables  g  m  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2231 . . . 4  |- recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  = recs (
( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )
2 eqid 2231 . . . . 5  |-  ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )  =  ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )
32frectfr 6565 . . . 4  |-  ( ( A. z ( F `
 z )  e. 
_V  /\  A  e.  V )  ->  A. y
( Fun  ( g  e.  _V  |->  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } )  /\  ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) `  y )  e.  _V ) )
41, 3tfri1d 6500 . . 3  |-  ( ( A. z ( F `
 z )  e. 
_V  /\  A  e.  V )  -> recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  Fn  On )
5 fnresin1 5447 . . 3  |-  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  Fn  On  ->  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  ( On  i^i  om ) )  Fn  ( On  i^i  om ) )
64, 5syl 14 . 2  |-  ( ( A. z ( F `
 z )  e. 
_V  /\  A  e.  V )  ->  (recs ( ( g  e. 
_V  |->  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  ( On  i^i  om ) )  Fn  ( On  i^i  om ) )
7 omsson 4711 . . . . . 6  |-  om  C_  On
8 sseqin2 3426 . . . . . 6  |-  ( om  C_  On  <->  ( On  i^i  om )  =  om )
97, 8mpbi 145 . . . . 5  |-  ( On 
i^i  om )  =  om
109reseq2i 5010 . . . 4  |-  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  ( On  i^i  om ) )  =  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
11 df-frec 6556 . . . 4  |- frec ( F ,  A )  =  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
1210, 11eqtr4i 2255 . . 3  |-  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  ( On  i^i  om ) )  = frec ( F ,  A )
13 fneq12 5423 . . 3  |-  ( ( (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  ( On  i^i  om ) )  = frec ( F ,  A )  /\  ( On  i^i  om )  =  om )  ->  (
(recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  ( On  i^i  om ) )  Fn  ( On  i^i  om )  <-> frec ( F ,  A
)  Fn  om )
)
1412, 9, 13mp2an 426 . 2  |-  ( (recs ( ( g  e. 
_V  |->  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  ( On  i^i  om ) )  Fn  ( On  i^i  om )  <-> frec ( F ,  A
)  Fn  om )
156, 14sylib 122 1  |-  ( ( A. z ( F `
 z )  e. 
_V  /\  A  e.  V )  -> frec ( F ,  A )  Fn 
om )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 715   A.wal 1395    = wceq 1397    e. wcel 2202   {cab 2217   E.wrex 2511   _Vcvv 2802    i^i cin 3199    C_ wss 3200   (/)c0 3494    |-> cmpt 4150   Oncon0 4460   suc csuc 4462   omcom 4688   dom cdm 4725    |` cres 4727    Fn wfn 5321   ` cfv 5326  recscrecs 6469  freccfrec 6555
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-recs 6470  df-frec 6556
This theorem is referenced by:  frecrdg  6573  frec2uzrand  10666  frec2uzf1od  10667  frecfzennn  10687  hashinfom  11039
  Copyright terms: Public domain W3C validator