Theorem 3brtr3i 5171

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 5165	. 2 ⊢ 𝐶𝑅𝐵
4		3brtr3.3	. 2 ⊢ 𝐵 = 𝐷
5	3, 4	breqtri 5167	1 ⊢ 𝐶𝑅𝐷

Syntax hints:   = wceq 1539   class class class wbr 5142

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-clel 2815  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-ss 3967  df-nul 4333  df-if 4525  df-sn 4626  df-pr 4628  df-op 4632  df-br 5143

This theorem is referenced by:  supsrlem  11152  ef01bndlem  16221  pige3ALT  26563  log2ublem1  26990  log2ub  26993  ppiublem1  27247  logfacrlim2  27271  chebbnd1  27517  nmoptri2i  32119  dpmul4  32897  problem5  35675  fouriersw  46251