Theorem breq123d 5120

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 5119	. 2 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑅𝐷))
4		breq123d.2	. . 3 ⊢ (𝜑 → 𝑅 = 𝑆)
5	4	breqd 5117	. 2 ⊢ (𝜑 → (𝐵𝑅𝐷 ↔ 𝐵𝑆𝐷))
6	3, 5	bitrd 282	1 ⊢ (𝜑 → (𝐴𝑅𝐶 ↔ 𝐵𝑆𝐷))

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

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107

This theorem is used by:  sbcbr123  5163  fmptco  7151  fnwe2lem1  8169  uncov  8918  xpsle  17777  invfuc  18178  yonedainv  18481  submomnd  20373  suborng  21160  opphllem3  29252  plngval  29282  lmif  29317  islmib  29319  iscgra  29343  isinag  29384  fmptcof2  33320  sgnsv  33788  inftmrel  33808  isinftm  33809  submarchi  33814  rlocval  33887  rprmval  34115  weiunval  37427  iscvlat  40571  paddfval  41045  lhpset  41243  tendofset  42006  diaffval  42278  aomclem8  44254  afv2eq12d  48488  fuconuniqex  50989  fuconuniqex2  50990