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

Theorem frecfnom 6610
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 6609 . . . 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 6544 . . 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 5454 . . 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 4717 . . . . . 6  |-  om  C_  On
8 sseqin2 3428 . . . . . 6  |-  ( om  C_  On  <->  ( On  i^i  om )  =  om )
97, 8mpbi 145 . . . . 5  |-  ( On 
i^i  om )  =  om
109reseq2i 5016 . . . 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 6600 . . . 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 5430 . . 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 716   A.wal 1396    = wceq 1398    e. wcel 2202   {cab 2217   E.wrex 2512   _Vcvv 2803    i^i cin 3200    C_ wss 3201   (/)c0 3496    |-> cmpt 4155   Oncon0 4466   suc csuc 4468   omcom 4694   dom cdm 4731    |` cres 4733    Fn wfn 5328   ` cfv 5333  recscrecs 6513  freccfrec 6599
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-recs 6514  df-frec 6600
This theorem is referenced by:  frecrdg  6617  frec2uzrand  10730  frec2uzf1od  10731  frecfzennn  10751  hashinfom  11103
  Copyright terms: Public domain W3C validator