Theorem 3brtr3i 4011

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

Hypotheses

Ref	Expression
3brtr3.1	⊢ 𝐴𝑅𝐵
3brtr3.2	⊢ 𝐴 = 𝐶
3brtr3.3	⊢ 𝐵 = 𝐷

Assertion

Ref	Expression
3brtr3i	⊢ 𝐶𝑅𝐷

Proof of Theorem 3brtr3i

Step	Hyp	Ref	Expression
1		3brtr3.2	. . 3 ⊢ 𝐴 = 𝐶
2		3brtr3.1	. . 3 ⊢ 𝐴𝑅𝐵
3	1, 2	eqbrtrri 4005	. 2 ⊢ 𝐶𝑅𝐵
4		3brtr3.3	. 2 ⊢ 𝐵 = 𝐷
5	3, 4	breqtri 4007	1 ⊢ 𝐶𝑅𝐷

Syntax hints:   = wceq 1343   class class class wbr 3982

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147

This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-v 2728  df-un 3120  df-sn 3582  df-pr 3583  df-op 3585  df-br 3983

This theorem is referenced by:  suplocsrlempr  7748  iap0  9080  ef01bndlem  11697