Theorem breqdi 5100

Description: Equality deduction for a binary relation. (Contributed by Thierry Arnoux, 5-Oct-2020.)

Hypotheses

Ref	Expression
breq1d.1	⊢ (𝜑 → 𝐴 = 𝐵)
breqdi.1	⊢ (𝜑 → 𝐶𝐴𝐷)

Assertion

Ref	Expression
breqdi	⊢ (𝜑 → 𝐶𝐵𝐷)

Proof of Theorem breqdi

Step	Hyp	Ref	Expression
1		breqdi.1	. 2 ⊢ (𝜑 → 𝐶𝐴𝐷)
2		breq1d.1	. . 3 ⊢ (𝜑 → 𝐴 = 𝐵)
3	2	breqd 5096	. 2 ⊢ (𝜑 → (𝐶𝐴𝐷 ↔ 𝐶𝐵𝐷))
4	1, 3	mpbid 232	1 ⊢ (𝜑 → 𝐶𝐵𝐷)

Syntax hints:   → wi 4   = wceq 1542   class class class wbr 5085

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782  df-cleq 2728  df-clel 2811  df-br 5086

This theorem is referenced by:  rtrclreclem3  15022  episect  17752  dvef  25947  acopyeu  28902  isleagd  28916  weiunso  36648  0prjspn  43061  brfvimex  44453  brovmptimex  44454  ntrclsnvobr  44479  clsneibex  44529  neicvgbex  44539  up1st2nd  49660  up1st2ndr  49661