Theorem 3brtr4g 4164

Description: Substitution of equality into both sides of a binary relation. (Contributed by NM, 16-Jan-1997.)

Hypotheses

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

Assertion

Ref	Expression
3brtr4g	|- ( ph -> C R D )

Proof of Theorem 3brtr4g

Step	Hyp	Ref	Expression
1		3brtr4g.1	. 2 |- ( ph -> A R B )
2		3brtr4g.2	. . 3 |- C = A
3		3brtr4g.3	. . 3 |- D = B
4	2, 3	breq12i 4139	. 2 |- ( C R D <-> A R B )
5	1, 4	sylibr 134	1 |- ( ph -> C R D )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   class class class wbr 4130

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-un 3224  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131

This theorem is used by:  eqbrtrid  4165  enpr2d  7111  crth  13002  4sqlem6  13162  gausslemma2dlem0f  16173  gausslemma2dlem0g  16174  wlkcompim  16593  upgrwlkcompim  16603  trilpolemgt1  17088