Theorem syl5eqbrr 2090

Description: A chained equality inference for a binary relation.

Hypotheses

Ref	Expression
syl5eqbrr.1	|- (ph -> ARB)
syl5eqbrr.2	|- A = C

Assertion

Ref	Expression
syl5eqbrr	|- (ph -> CRB)

Proof of Theorem syl5eqbrr

Step	Hyp	Ref	Expression
1		syl5eqbrr.1	. 2 |- (ph -> ARB)
2		syl5eqbrr.2	. 2 |- A = C
3		cleqid 1102	. 2 |- B = B
4	1, 2, 3	3brtr3g 2087	1 |- (ph -> CRB)

Syntax hints:   -> wi 2   = wceq 1091   class class class wbr 2054

This theorem is referenced by:  infdif 4948

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-op 1815  df-br 2063

metamath.org