Theorem 3brtr3i 5129

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

Syntax hints:   = wceq 1560   class class class wbr 5100

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101

This theorem is referenced by:  supsrlem  11069  ef01bndlem  16216  pige3ALT  26585  log2ublem1  27011  log2ub  27014  ppiublem1  27266  logfacrlim2  27290  chebbnd1  27536  twocut  28516  bdayfinbndlem1  28560  nmoptri2i  32302  dpmul4  33091  problem5  36019  fouriersw  46805