Theorem 3brtr3i 5125

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

Syntax hints:   = wceq 1541   class class class wbr 5096

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-br 5097

This theorem is referenced by:  supsrlem  11020  ef01bndlem  16107  pige3ALT  26483  log2ublem1  26910  log2ub  26913  ppiublem1  27167  logfacrlim2  27191  chebbnd1  27437  twocut  28381  nmoptri2i  32123  dpmul4  32944  problem5  35812  fouriersw  46417