Theorem breq123d 5117

Description: Equality deduction for a binary relation. (Contributed by NM, 29-Oct-2011.)

Hypotheses

Ref	Expression
breq1d.1	⊢ (𝜑 → 𝐴 = 𝐵)
breq123d.2	⊢ (𝜑 → 𝑅 = 𝑆)
breq123d.3	⊢ (𝜑 → 𝐶 = 𝐷)

Assertion

Ref	Expression
breq123d	⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑆𝐷))

Proof of Theorem breq123d

Step	Hyp	Ref	Expression
1		breq1d.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
2		breq123d.3	. . 3 ⊢ (𝜑 → 𝐶 = 𝐷)
3	1, 2	breq12d 5116	. 2 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷))
4		breq123d.2	. . 3 ⊢ (𝜑 → 𝑅 = 𝑆)
5	4	breqd 5114	. 2 ⊢ (𝜑 → (𝐵𝑅𝐷 ↔ 𝐵𝑆𝐷))
6	3, 5	bitrd 282	1 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑆𝐷))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   class class class wbr 5103

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104

This theorem is used by:  sbcbr123  5159  fmptco  7126  uncov  8879  xpsle  17690  invfuc  18091  yonedainv  18394  submomnd  20285  suborng  21072  opphllem3  29136  plngval  29166  lmif  29201  islmib  29203  iscgra  29227  isinag  29268  fmptcof2  33162  sgnsv  33632  inftmrel  33652  isinftm  33653  submarchi  33658  rlocval  33731  rprmval  33959  weiunval  37148  iscvlat  40261  paddfval  40735  lhpset  40933  tendofset  41696  diaffval  41968  fnwe2val  43955  aomclem8  43967  afv2eq12d  48168