HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem breqi 2625
Description: Equality inference for binary relations.
Hypothesis
Ref Expression
breqi.1 |- R = S
Assertion
Ref Expression
breqi |- (ARB <-> ASB)

Proof of Theorem breqi
StepHypRef Expression
1 breqi.1 . 2 |- R = S
2 breq 2621 . 2 |- (R = S -> (ARB <-> ASB))
31, 2ax-mp 7 1 |- (ARB <-> ASB)
Colors of variables: wff set class
Syntax hints:   <-> wb 146   = wceq 956   class class class wbr 2619
This theorem is referenced by:  brabsb 2816  avril1 8784  axhcompl 8868  hhcmpl 9069
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-17 971  ax-4 973  ax-5o 975  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-cleq 1469  df-clel 1472  df-br 2620
Copyright terms: Public domain