Theorem eqbrtrrdi 5140

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 2743	. 2 ⊢ (𝜑 → 𝐴 = 𝐵)
3		eqbrtrrdi.2	. 2 ⊢ 𝐵𝑅𝐶
4	2, 3	eqbrtrdi 5139	1 ⊢ (𝜑 → 𝐴𝑅𝐶)

Syntax hints:   → wi 4   = wceq 1542   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 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101

This theorem is referenced by:  grur1  10743  t1connperf  23392  basellem9  27067  sqff1o  27160  ballotlemic  34685  ballotlem1c  34686  pibt2  37672