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

Theorem frecfun 6560
Description: Finite recursion produces a function. See also frecfnom 6566 which also states that the domain of that function is  om but which puts conditions on  A and  F. (Contributed by Jim Kingdon, 13-Feb-2022.)
Assertion
Ref Expression
frecfun  |-  Fun frec ( F ,  A )

Proof of Theorem frecfun
Dummy variables  g  m  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 tfrfun 6485 . . 3  |-  Fun recs (
( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )
2 funres 5367 . . 3  |-  ( Fun recs
( ( g  e. 
_V  |->  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  ->  Fun  (recs ( ( g  e. 
_V  |->  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
)
31, 2ax-mp 5 . 2  |-  Fun  (recs ( ( g  e. 
_V  |->  { x  |  ( E. m  e. 
om  ( dom  g  =  suc  m  /\  x  e.  ( F `  (
g `  m )
) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
4 df-frec 6556 . . 3  |- 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 )
54funeqi 5347 . 2  |-  ( Fun frec
( F ,  A
)  <->  Fun  (recs ( ( g  e.  _V  |->  { x  |  ( E. m  e.  om  ( dom  g  =  suc  m  /\  x  e.  ( F `  ( g `
 m ) ) )  \/  ( dom  g  =  (/)  /\  x  e.  A ) ) } ) )  |`  om )
)
63, 5mpbir 146 1  |-  Fun frec ( F ,  A )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    \/ wo 715    = wceq 1397    e. wcel 2202   {cab 2217   E.wrex 2511   _Vcvv 2802   (/)c0 3494    |-> cmpt 4150   suc csuc 4462   omcom 4688   dom cdm 4725    |` cres 4727   Fun wfun 5320   ` 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-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-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-setind 4635
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  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-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  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-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-res 4737  df-iota 5286  df-fun 5328  df-fn 5329  df-fv 5334  df-recs 6470  df-frec 6556
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator