ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ereq1 Unicode version

Theorem ereq1 6804
Description: Equality theorem for equivalence predicate. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 12-Aug-2015.)
Assertion
Ref Expression
ereq1  |-  ( R  =  S  ->  ( R  Er  A  <->  S  Er  A ) )

Proof of Theorem ereq1
StepHypRef Expression
1 releq 4852 . . 3  |-  ( R  =  S  ->  ( Rel  R  <->  Rel  S ) )
2 dmeq 4976 . . . 4  |-  ( R  =  S  ->  dom  R  =  dom  S )
32eqeq1d 2247 . . 3  |-  ( R  =  S  ->  ( dom  R  =  A  <->  dom  S  =  A ) )
4 cnveq 4949 . . . . . 6  |-  ( R  =  S  ->  `' R  =  `' S
)
5 coeq1 4932 . . . . . . 7  |-  ( R  =  S  ->  ( R  o.  R )  =  ( S  o.  R ) )
6 coeq2 4933 . . . . . . 7  |-  ( R  =  S  ->  ( S  o.  R )  =  ( S  o.  S ) )
75, 6eqtrd 2271 . . . . . 6  |-  ( R  =  S  ->  ( R  o.  R )  =  ( S  o.  S ) )
84, 7uneq12d 3384 . . . . 5  |-  ( R  =  S  ->  ( `' R  u.  ( R  o.  R )
)  =  ( `' S  u.  ( S  o.  S ) ) )
98sseq1d 3277 . . . 4  |-  ( R  =  S  ->  (
( `' R  u.  ( R  o.  R
) )  C_  R  <->  ( `' S  u.  ( S  o.  S )
)  C_  R )
)
10 sseq2 3272 . . . 4  |-  ( R  =  S  ->  (
( `' S  u.  ( S  o.  S
) )  C_  R  <->  ( `' S  u.  ( S  o.  S )
)  C_  S )
)
119, 10bitrd 188 . . 3  |-  ( R  =  S  ->  (
( `' R  u.  ( R  o.  R
) )  C_  R  <->  ( `' S  u.  ( S  o.  S )
)  C_  S )
)
121, 3, 113anbi123d 1353 . 2  |-  ( R  =  S  ->  (
( Rel  R  /\  dom  R  =  A  /\  ( `' R  u.  ( R  o.  R )
)  C_  R )  <->  ( Rel  S  /\  dom  S  =  A  /\  ( `' S  u.  ( S  o.  S )
)  C_  S )
) )
13 df-er 6797 . 2  |-  ( R  Er  A  <->  ( Rel  R  /\  dom  R  =  A  /\  ( `' R  u.  ( R  o.  R ) ) 
C_  R ) )
14 df-er 6797 . 2  |-  ( S  Er  A  <->  ( Rel  S  /\  dom  S  =  A  /\  ( `' S  u.  ( S  o.  S ) ) 
C_  S ) )
1512, 13, 143bitr4g 223 1  |-  ( R  =  S  ->  ( R  Er  A  <->  S  Er  A ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    /\ w3a 1009    = wceq 1402    u. cun 3218    C_ wss 3220   `'ccnv 4768   dom cdm 4769    o. ccom 4773   Rel wrel 4774    Er wer 6794
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-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 theorem 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-in 3226  df-ss 3233  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-opab 4188  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-er 6797
This theorem is referenced by:  riinerm  6872
  Copyright terms: Public domain W3C validator