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

Theorem seeq2 4466
Description: Equality theorem for the set-like predicate. (Contributed by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
seeq2  |-  ( A  =  B  ->  ( R Se  A  <->  R Se  B )
)

Proof of Theorem seeq2
StepHypRef Expression
1 eqimss2 3297 . . 3  |-  ( A  =  B  ->  B  C_  A )
2 sess2 4464 . . 3  |-  ( B 
C_  A  ->  ( R Se  A  ->  R Se  B
) )
31, 2syl 14 . 2  |-  ( A  =  B  ->  ( R Se  A  ->  R Se  B
) )
4 eqimss 3296 . . 3  |-  ( A  =  B  ->  A  C_  B )
5 sess2 4464 . . 3  |-  ( A 
C_  B  ->  ( R Se  B  ->  R Se  A
) )
64, 5syl 14 . 2  |-  ( A  =  B  ->  ( R Se  B  ->  R Se  A
) )
73, 6impbid 129 1  |-  ( A  =  B  ->  ( R Se  A  <->  R Se  B )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1398    C_ wss 3214   Se wse 4455
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2216  ax-sep 4233
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rab 2531  df-v 2817  df-in 3220  df-ss 3227  df-se 4459
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator