Theorem eqbrtrrdi 5137

Description: A chained equality inference for a binary relation. (Contributed by NM, 4-Jan-2006.)

Hypotheses

Ref	Expression
eqbrtrrdi.1	⊢ (𝜑 → 𝐵 = 𝐴)
eqbrtrrdi.2	⊢ 𝐵𝑅𝐶

Assertion

Ref	Expression
eqbrtrrdi	⊢ (𝜑 → 𝐴𝑅𝐶)

Proof of Theorem eqbrtrrdi

Step	Hyp	Ref	Expression
1		eqbrtrrdi.1	. . 3 ⊢ (𝜑 → 𝐵 = 𝐴)
2	1	eqcomd 2767	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
3		eqbrtrrdi.2	. 2 ⊢ 𝐵𝑅𝐶
4	2, 3	eqbrtrdi 5136	1 ⊢ (𝜑 → 𝐴𝑅𝐶)

Syntax hints:   → wi 4   = wceq 1559   class class class wbr 5097

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-br 5098

This theorem is referenced by:  grur1  10772  t1connperf  23484  basellem9  27141  sqff1o  27234  ballotlemic  34765  ballotlem1c  34766  pibt2  37872