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

Theorem releq 4775
Description: Equality theorem for the relation predicate. (Contributed by NM, 1-Aug-1994.)
Assertion
Ref Expression
releq  |-  ( A  =  B  ->  ( Rel  A  <->  Rel  B ) )

Proof of Theorem releq
StepHypRef Expression
1 sseq1 3224 . 2  |-  ( A  =  B  ->  ( A  C_  ( _V  X.  _V )  <->  B  C_  ( _V 
X.  _V ) ) )
2 df-rel 4700 . 2  |-  ( Rel 
A  <->  A  C_  ( _V 
X.  _V ) )
3 df-rel 4700 . 2  |-  ( Rel 
B  <->  B  C_  ( _V 
X.  _V ) )
41, 2, 33bitr4g 223 1  |-  ( A  =  B  ->  ( Rel  A  <->  Rel  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1373   _Vcvv 2776    C_ wss 3174    X. cxp 4691   Rel wrel 4698
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 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-11 1530  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-in 3180  df-ss 3187  df-rel 4700
This theorem is referenced by:  releqi  4776  releqd  4777  dfrel2  5152  tposfn2  6375  ereq1  6650
  Copyright terms: Public domain W3C validator