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

Theorem rdgifnon 6437
Description: The recursive definition generator is a function on ordinal numbers. The  F  Fn  _V condition states that the characteristic function is defined for all sets (being defined for all ordinals might be enough if being used in a manner similar to rdgon 6444; in cases like df-oadd 6478 either presumably could work). (Contributed by Jim Kingdon, 13-Jul-2019.)
Assertion
Ref Expression
rdgifnon  |-  ( ( F  Fn  _V  /\  A  e.  V )  ->  rec ( F ,  A )  Fn  On )

Proof of Theorem rdgifnon
Dummy variables  f  g  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-irdg 6428 . 2  |-  rec ( F ,  A )  = recs ( ( g  e. 
_V  |->  ( A  u.  U_ x  e.  dom  g
( F `  (
g `  x )
) ) ) )
2 rdgruledefgg 6433 . . 3  |-  ( ( F  Fn  _V  /\  A  e.  V )  ->  ( Fun  ( g  e.  _V  |->  ( A  u.  U_ x  e. 
dom  g ( F `
 ( g `  x ) ) ) )  /\  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  f )  e.  _V ) )
32alrimiv 1888 . 2  |-  ( ( F  Fn  _V  /\  A  e.  V )  ->  A. f ( Fun  ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) )  /\  ( ( g  e.  _V  |->  ( A  u.  U_ x  e.  dom  g ( F `
 ( g `  x ) ) ) ) `  f )  e.  _V ) )
41, 3tfri1d 6393 1  |-  ( ( F  Fn  _V  /\  A  e.  V )  ->  rec ( F ,  A )  Fn  On )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2167   _Vcvv 2763    u. cun 3155   U_ciun 3916    |-> cmpt 4094   Oncon0 4398   dom cdm 4663   Fun wfun 5252    Fn wfn 5253   ` cfv 5258   reccrdg 6427
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  df-irdg 6428
This theorem is referenced by:  rdgivallem  6439
  Copyright terms: Public domain W3C validator