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

Theorem tfri2d 6545
Description: Principle of Transfinite Recursion, part 2 of 3. Theorem 7.41(2) of [TakeutiZaring] p. 47, with an additional condition on the recursion rule  G ( as described at tfri1 6574). Here we show that the function  F has the property that for any function  G satisfying that condition, the "next" value of  F is  G recursively applied to all "previous" values of  F. (Contributed by Jim Kingdon, 4-May-2019.)
Hypotheses
Ref Expression
tfri1d.1  |-  F  = recs ( G )
tfri1d.2  |-  ( ph  ->  A. x ( Fun 
G  /\  ( G `  x )  e.  _V ) )
Assertion
Ref Expression
tfri2d  |-  ( (
ph  /\  A  e.  On )  ->  ( F `
 A )  =  ( G `  ( F  |`  A ) ) )
Distinct variable group:    x, G
Allowed substitution hints:    ph( x)    A( x)    F( x)

Proof of Theorem tfri2d
StepHypRef Expression
1 tfri1d.1 . . . . . 6  |-  F  = recs ( G )
2 tfri1d.2 . . . . . 6  |-  ( ph  ->  A. x ( Fun 
G  /\  ( G `  x )  e.  _V ) )
31, 2tfri1d 6544 . . . . 5  |-  ( ph  ->  F  Fn  On )
4 fndm 5436 . . . . 5  |-  ( F  Fn  On  ->  dom  F  =  On )
53, 4syl 14 . . . 4  |-  ( ph  ->  dom  F  =  On )
65eleq2d 2301 . . 3  |-  ( ph  ->  ( A  e.  dom  F  <-> 
A  e.  On ) )
76biimpar 297 . 2  |-  ( (
ph  /\  A  e.  On )  ->  A  e. 
dom  F )
81tfr2a 6530 . 2  |-  ( A  e.  dom  F  -> 
( F `  A
)  =  ( G `
 ( F  |`  A ) ) )
97, 8syl 14 1  |-  ( (
ph  /\  A  e.  On )  ->  ( F `
 A )  =  ( G `  ( F  |`  A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1396    = wceq 1398    e. wcel 2202   _Vcvv 2803   Oncon0 4466   dom cdm 4731    |` cres 4733   Fun wfun 5327    Fn wfn 5328   ` cfv 5333  recscrecs 6513
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-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641
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-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-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
This theorem is referenced by:  rdgivallem  6590
  Copyright terms: Public domain W3C validator