Theorem breq 4095

Description: Equality theorem for binary relations. (Contributed by NM, 4-Jun-1995.)

Assertion

Ref	Expression
breq	|- ( R = S -> ( A R B <-> A S B ) )

Proof of Theorem breq

Step	Hyp	Ref	Expression
1		eleq2 2295	. 2 |- ( R = S -> ( <. A , B >. e. R <-> <. A , B >. e. S ) )
2		df-br 4094	. 2 |- ( A R B <-> <. A , B >. e. R )
3		df-br 4094	. 2 |- ( A S B <-> <. A , B >. e. S )
4	1, 2, 3	3bitr4g 223	1 |- ( R = S -> ( A R B <-> A S B ) )

Syntax hints:   -> wi 4   <-> wb 105   = wceq 1398   e. wcel 2202   <.cop 3676   class class class wbr 4093

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1496  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-4 1559  ax-17 1575  ax-ial 1583  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-cleq 2224  df-clel 2227  df-br 4094

This theorem is referenced by:  breqi  4099  breqd  4104  poeq1  4402  soeq1  4418  frforeq1  4446  weeq1  4459  fveq1  5647  foeqcnvco  5941  f1eqcocnv  5942  isoeq2  5953  isoeq3  5954  ofreq  6248  supeq3  7232  tapeq1  7514  shftfvalg  11439  shftfval  11442  pw1nct  16705