Theorem 3brtr3d 2086

Description: Substitution of equality into both sides of a binary relation.

Hypotheses

Ref	Expression
3brtr3d.1	|- (ph -> ARB)
3brtr3d.2	|- (ph -> A = C)
3brtr3d.3	|- (ph -> B = D)

Assertion

Ref	Expression
3brtr3d	|- (ph -> CRD)

Proof of Theorem 3brtr3d

Step	Hyp	Ref	Expression
1		3brtr3d.1	. 2 |- (ph -> ARB)
2		3brtr3d.2	. . 3 |- (ph -> A = C)
3		3brtr3d.3	. . 3 |- (ph -> B = D)
4	2, 3	breq12d 2073	. 2 |- (ph -> (ARB <-> CRD))
5	1, 4	mpbid 170	1 |- (ph -> CRD)

Syntax hints:   -> wi 2   = wceq 1091   class class class wbr 2054

This theorem is referenced by:  phplem3 3405  ltaddpq 3873  osumlem3 5532

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063

metamath.org