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

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

Proof of Theorem ofreq
Dummy variables  f  g  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq 3787 . . . 4  |-  ( R  =  S  ->  (
( f `  x
) R ( g `
 x )  <->  ( f `  x ) S ( g `  x ) ) )
21ralbidv 2368 . . 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 3844 . 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 5733 . 2  |-  oR R  =  { <. f ,  g >.  |  A. x  e.  ( dom  f  i^i  dom  g )
( f `  x
) R ( g `
 x ) }
5 df-ofr 5733 . 2  |-  oR S  =  { <. f ,  g >.  |  A. x  e.  ( dom  f  i^i  dom  g )
( f `  x
) S ( g `
 x ) }
63, 4, 53eqtr4g 2138 1  |-  ( R  =  S  ->  oR R  =  oR S )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1284   A.wral 2348    i^i cin 2972   class class class wbr 3785   {copab 3838   dom cdm 4363   ` cfv 4922    oRcofr 5731
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-11 1437  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-ral 2353  df-br 3786  df-opab 3840  df-ofr 5733
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator