MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  seeq1 Structured version   Visualization version   Unicode version

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

Proof of Theorem seeq1
StepHypRef Expression
1 eqimss2 3658 . . 3  |-  ( R  =  S  ->  S  C_  R )
2 sess1 5082 . . 3  |-  ( S 
C_  R  ->  ( R Se  A  ->  S Se  A
) )
31, 2syl 17 . 2  |-  ( R  =  S  ->  ( R Se  A  ->  S Se  A
) )
4 eqimss 3657 . . 3  |-  ( R  =  S  ->  R  C_  S )
5 sess1 5082 . . 3  |-  ( R 
C_  S  ->  ( S Se  A  ->  R Se  A
) )
64, 5syl 17 . 2  |-  ( R  =  S  ->  ( S Se  A  ->  R Se  A
) )
73, 6impbid 202 1  |-  ( R  =  S  ->  ( R Se  A  <->  S Se  A )
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    = wceq 1483    C_ wss 3574   Se wse 5071
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rab 2921  df-v 3202  df-in 3581  df-ss 3588  df-br 4654  df-se 5074
This theorem is referenced by:  oieq1  8417
  Copyright terms: Public domain W3C validator