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

Theorem seeq2 5562
Description: Equality theorem for the set-like predicate. (Contributed by Mario Carneiro, 24-Jun-2015.)
Assertion
Ref Expression
seeq2 (𝐴 = 𝐵 → (𝑅 Se 𝐴𝑅 Se 𝐵))

Proof of Theorem seeq2
StepHypRef Expression
1 eqimss2 3978 . . 3 (𝐴 = 𝐵𝐵𝐴)
2 sess2 5558 . . 3 (𝐵𝐴 → (𝑅 Se 𝐴𝑅 Se 𝐵))
31, 2syl 17 . 2 (𝐴 = 𝐵 → (𝑅 Se 𝐴𝑅 Se 𝐵))
4 eqimss 3977 . . 3 (𝐴 = 𝐵𝐴𝐵)
5 sess2 5558 . . 3 (𝐴𝐵 → (𝑅 Se 𝐵𝑅 Se 𝐴))
64, 5syl 17 . 2 (𝐴 = 𝐵 → (𝑅 Se 𝐵𝑅 Se 𝐴))
73, 6impbid 211 1 (𝐴 = 𝐵 → (𝑅 Se 𝐴𝑅 Se 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1539  wss 3887   Se wse 5542
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1542  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rab 3073  df-v 3434  df-in 3894  df-ss 3904  df-se 5545
This theorem is referenced by:  oieq2  9272
  Copyright terms: Public domain W3C validator