Theorem 3brtr3i 4117

Description: Substitution of equality into both sides of a binary relation. (Contributed by NM, 11-Aug-1999.)

Hypotheses

Ref	Expression
3brtr3.1	|- A R B
3brtr3.2	|- A = C
3brtr3.3	|- B = D

Assertion

Ref	Expression
3brtr3i	|- C R D

Proof of Theorem 3brtr3i

Step	Hyp	Ref	Expression
1		3brtr3.2	. . 3 |- A = C
2		3brtr3.1	. . 3 |- A R B
3	1, 2	eqbrtrri 4111	. 2 |- C R B
4		3brtr3.3	. 2 |- B = D
5	3, 4	breqtri 4113	1 |- C R D

Syntax hints:   = wceq 1397   class class class wbr 4088

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-v 2804  df-un 3204  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089

This theorem is referenced by:  suplocsrlempr  8026  iap0  9366  ef01bndlem  12316