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

Theorem tfr2a 6530
Description: A weak version of transfinite recursion. (Contributed by Mario Carneiro, 24-Jun-2015.)
Hypothesis
Ref Expression
tfr.1  |-  F  = recs ( G )
Assertion
Ref Expression
tfr2a  |-  ( A  e.  dom  F  -> 
( F `  A
)  =  ( G `
 ( F  |`  A ) ) )

Proof of Theorem tfr2a
Dummy variables  x  f  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2231 . . . 4  |-  { f  |  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }  =  { f  |  E. x  e.  On  ( f  Fn  x  /\  A. y  e.  x  ( f `  y )  =  ( G `  ( f  |`  y ) ) ) }
21tfrlem9 6528 . . 3  |-  ( A  e.  dom recs ( G
)  ->  (recs ( G ) `  A
)  =  ( G `
 (recs ( G )  |`  A )
) )
3 tfr.1 . . . 4  |-  F  = recs ( G )
43dmeqi 4938 . . 3  |-  dom  F  =  dom recs ( G )
52, 4eleq2s 2326 . 2  |-  ( A  e.  dom  F  -> 
(recs ( G ) `
 A )  =  ( G `  (recs ( G )  |`  A ) ) )
63fveq1i 5649 . 2  |-  ( F `
 A )  =  (recs ( G ) `
 A )
73reseq1i 5015 . . 3  |-  ( F  |`  A )  =  (recs ( G )  |`  A )
87fveq2i 5651 . 2  |-  ( G `
 ( F  |`  A ) )  =  ( G `  (recs ( G )  |`  A ) )
95, 6, 83eqtr4g 2289 1  |-  ( A  e.  dom  F  -> 
( F `  A
)  =  ( G `
 ( F  |`  A ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1398    e. wcel 2202   {cab 2217   A.wral 2511   E.wrex 2512   Oncon0 4466   dom cdm 4731    |` cres 4733    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-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-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-setind 4641
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  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-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  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-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-recs 6514
This theorem is referenced by:  tfr0  6532  tfri2d  6545  tfrcl  6573  tfri2  6575  frecsuclem  6615
  Copyright terms: Public domain W3C validator