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

Theorem releqd 4688
Description: Equality deduction for the relation predicate. (Contributed by NM, 8-Mar-2014.)
Hypothesis
Ref Expression
releqd.1  |-  ( ph  ->  A  =  B )
Assertion
Ref Expression
releqd  |-  ( ph  ->  ( Rel  A  <->  Rel  B ) )

Proof of Theorem releqd
StepHypRef Expression
1 releqd.1 . 2  |-  ( ph  ->  A  =  B )
2 releq 4686 . 2  |-  ( A  =  B  ->  ( Rel  A  <->  Rel  B ) )
31, 2syl 14 1  |-  ( ph  ->  ( Rel  A  <->  Rel  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1343   Rel wrel 4609
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-11 1494  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-nf 1449  df-sb 1751  df-clab 2152  df-cleq 2158  df-clel 2161  df-in 3122  df-ss 3129  df-rel 4611
This theorem is referenced by:  dftpos3  6230  tposfo2  6235  tposf12  6237  lmreltop  12833  cnprcl2k  12846
  Copyright terms: Public domain W3C validator