Theorem eqbrtrrdi 5151

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

This proof depends on syntax axioms:   → wi 4   = wceq 1570   class class class wbr 5108

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109

This theorem is used by:  grur1  10944  t1connperf  23809  basellem9  27473  sqff1o  27566  ballotlemic  35250  ballotlem1c  35251  pibt2  38608