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

Theorem releq 4857
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 3271 . 2  |-  ( A  =  B  ->  ( A  C_  ( _V  X.  _V )  <->  B  C_  ( _V 
X.  _V ) ) )
2 df-rel 4781 . 2  |-  ( Rel 
A  <->  A  C_  ( _V 
X.  _V ) )
3 df-rel 4781 . 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
This proof depends on syntax axioms:    -> wi 4    <-> wb 105    = wceq 1402   _Vcvv 2821    C_ wss 3220    X. cxp 4772   Rel wrel 4779
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-11 1559  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-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-in 3226  df-ss 3233  df-rel 4781
This theorem is used by:  releqi  4858  releqd  4859  dfrel2  5238  tposfn2  6537  ereq1  6814
  Copyright terms: Public domain W3C validator