MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tfr2a Structured version   Unicode version

Theorem tfr2a 6854
Description: A weak version of tfr2 6857 which is useful for proofs that avoid the Axiom of Replacement. (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 2443 . . . 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 6844 . . 3  |-  ( A  e.  dom recs ( G
)  ->  (recs ( G ) `  A
)  =  ( G `
 (recs ( G )  |`  A )
) )
3 tfr.1 . . . 4  |-  F  = recs ( G )
43dmeqi 5041 . . 3  |-  dom  F  =  dom recs ( G )
52, 4eleq2s 2535 . 2  |-  ( A  e.  dom  F  -> 
(recs ( G ) `
 A )  =  ( G `  (recs ( G )  |`  A ) ) )
63fveq1i 5692 . 2  |-  ( F `
 A )  =  (recs ( G ) `
 A )
73reseq1i 5106 . . 3  |-  ( F  |`  A )  =  (recs ( G )  |`  A )
87fveq2i 5694 . 2  |-  ( G `
 ( F  |`  A ) )  =  ( G `  (recs ( G )  |`  A ) )
95, 6, 83eqtr4g 2500 1  |-  ( A  e.  dom  F  -> 
( F `  A
)  =  ( G `
 ( F  |`  A ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1369    e. wcel 1756   {cab 2429   A.wral 2715   E.wrex 2716   Oncon0 4719   dom cdm 4840    |` cres 4842    Fn wfn 5413   ` cfv 5418  recscrecs 6831
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4413  ax-nul 4421  ax-pow 4470  ax-pr 4531  ax-un 6372
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2568  df-ne 2608  df-ral 2720  df-rex 2721  df-rab 2724  df-v 2974  df-sbc 3187  df-csb 3289  df-dif 3331  df-un 3333  df-in 3335  df-ss 3342  df-pss 3344  df-nul 3638  df-if 3792  df-sn 3878  df-pr 3880  df-tp 3882  df-op 3884  df-uni 4092  df-iun 4173  df-br 4293  df-opab 4351  df-mpt 4352  df-tr 4386  df-eprel 4632  df-id 4636  df-po 4641  df-so 4642  df-fr 4679  df-we 4681  df-ord 4722  df-on 4723  df-xp 4846  df-rel 4847  df-cnv 4848  df-co 4849  df-dm 4850  df-rn 4851  df-res 4852  df-ima 4853  df-iota 5381  df-fun 5420  df-fn 5421  df-fv 5426  df-recs 6832
This theorem is referenced by:  tfr2  6857  rdgvalg  6875  ordtypelem3  7734
  Copyright terms: Public domain W3C validator