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

Theorem ofreq 6300
Description: Equality theorem for function relation. (Contributed by Mario Carneiro, 28-Jul-2014.)
Assertion
Ref Expression
ofreq  |-  ( R  =  S  ->  o R R  =  o R S )

Proof of Theorem ofreq
Dummy variables  f 
g  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq 4206 . . . 4  |-  ( R  =  S  ->  (
( f `  x
) R ( g `
 x )  <->  ( f `  x ) S ( g `  x ) ) )
21ralbidv 2717 . . 3  |-  ( R  =  S  ->  ( A. x  e.  ( dom  f  i^i  dom  g
) ( f `  x ) R ( g `  x )  <->  A. x  e.  ( dom  f  i^i  dom  g
) ( f `  x ) S ( g `  x ) ) )
32opabbidv 4263 . 2  |-  ( R  =  S  ->  { <. f ,  g >.  |  A. x  e.  ( dom  f  i^i  dom  g )
( f `  x
) R ( g `
 x ) }  =  { <. f ,  g >.  |  A. x  e.  ( dom  f  i^i  dom  g )
( f `  x
) S ( g `
 x ) } )
4 df-ofr 6298 . 2  |-  o R R  =  { <. f ,  g >.  |  A. x  e.  ( dom  f  i^i  dom  g )
( f `  x
) R ( g `
 x ) }
5 df-ofr 6298 . 2  |-  o R S  =  { <. f ,  g >.  |  A. x  e.  ( dom  f  i^i  dom  g )
( f `  x
) S ( g `
 x ) }
63, 4, 53eqtr4g 2492 1  |-  ( R  =  S  ->  o R R  =  o R S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1652   A.wral 2697    i^i cin 3311   class class class wbr 4204   {copab 4257   dom cdm 4870   ` cfv 5446    o Rcofr 6296
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416
This theorem depends on definitions:  df-bi 178  df-an 361  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-clab 2422  df-cleq 2428  df-clel 2431  df-ral 2702  df-br 4205  df-opab 4259  df-ofr 6298
  Copyright terms: Public domain W3C validator