Theorem 3brtr4g 2647

Description: Substitution of equality into both sides of a binary relation.

Hypotheses

Ref	Expression
3brtr4g.1	|- (ph -> ARB)
3brtr4g.2	|- C = A
3brtr4g.3	|- D = B

Assertion

Ref	Expression
3brtr4g	|- (ph -> CRD)

Proof of Theorem 3brtr4g

Step	Hyp	Ref	Expression
1		3brtr4g.1	. 2 |- (ph -> ARB)
2		3brtr4g.2	. . 3 |- C = A
3		3brtr4g.3	. . 3 |- D = B
4	2, 3	breq12i 2628	. 2 |- (CRD <-> ARB)
5	1, 4	sylibr 200	1 |- (ph -> CRD)

Syntax hints:   -> wi 3   = wceq 956   class class class wbr 2619

This theorem is referenced by:  syl5eqbr 2648  limensuci 4506  infensuc 4638  cdaen 4924  cdadom1 4933

This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459

This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-v 1812  df-un 2050  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620

Copyright terms: Public domain