Theorem breqdi 4668

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

Hypotheses

Ref	Expression
breq1d.1	|- ( ph -> A = B )
breqdi.1	|- ( ph -> C A D )

Assertion

Ref	Expression
breqdi	|- ( ph -> C B D )

Proof of Theorem breqdi

Step	Hyp	Ref	Expression
1		breqdi.1	. 2 |- ( ph -> C A D )
2		breq1d.1	. . 3 |- ( ph -> A = B )
3	2	breqd 4664	. 2 |- ( ph -> ( C A D <-> C B D ) )
4	1, 3	mpbid 222	1 |- ( ph -> C B D )

Syntax hints:   -> wi 4   = wceq 1483   class class class wbr 4653

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-cleq 2615  df-clel 2618  df-br 4654

This theorem is referenced by:  brfvimex  38324  brovmptimex  38325  ntrclsnvobr  38350  clsneibex  38400  neicvgbex  38410