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

Theorem breqan12rd 2633
Description: Equality deduction for a binary relation.
Hypotheses
Ref Expression
breq1d.1 |- (ph -> A = B)
breqan12i.2 |- (ps -> C = D)
Assertion
Ref Expression
breqan12rd |- ((ps /\ ph) -> (ARC <-> BRD))

Proof of Theorem breqan12rd
StepHypRef Expression
1 breq1d.1 . . 3 |- (ph -> A = B)
2 breqan12i.2 . . 3 |- (ps -> C = D)
31, 2breqan12d 2632 . 2 |- ((ph /\ ps) -> (ARC <-> BRD))
43ancoms 436 1 |- ((ps /\ ph) -> (ARC <-> BRD))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223   = wceq 956   class class class wbr 2619
This theorem is referenced by:  f1oweALT 3906  ltrpq 5085  ledivdivt 5890
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-v 1812  df-un 2050  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620
Copyright terms: Public domain