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

Theorem frecfun 6483
Description: Finite recursion produces a function. See also frecfnom 6489 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 6408 . . 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 5313 . . 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 6479 . . 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 5293 . 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 710    = wceq 1373    e. wcel 2176   {cab 2191   E.wrex 2485   _Vcvv 2772   (/)c0 3460    |-> cmpt 4106   suc csuc 4413   omcom 4639   dom cdm 4676    |` cres 4678   Fun wfun 5266   ` cfv 5272  recscrecs 6392  freccfrec 6478
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-14 2179  ax-ext 2187  ax-sep 4163  ax-pow 4219  ax-pr 4254  ax-setind 4586
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ral 2489  df-rex 2490  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-un 3170  df-in 3172  df-ss 3179  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-iun 3929  df-br 4046  df-opab 4107  df-mpt 4108  df-tr 4144  df-id 4341  df-iord 4414  df-on 4416  df-xp 4682  df-rel 4683  df-cnv 4684  df-co 4685  df-dm 4686  df-res 4688  df-iota 5233  df-fun 5274  df-fn 5275  df-fv 5280  df-recs 6393  df-frec 6479
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator