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

Theorem seeq2 5509
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 3944 . . 3 (𝐴 = 𝐵𝐵𝐴)
2 sess2 5505 . . 3 (𝐵𝐴 → (𝑅 Se 𝐴𝑅 Se 𝐵))
31, 2syl 17 . 2 (𝐴 = 𝐵 → (𝑅 Se 𝐴𝑅 Se 𝐵))
4 eqimss 3943 . . 3 (𝐴 = 𝐵𝐴𝐵)
5 sess2 5505 . . 3 (𝐴𝐵 → (𝑅 Se 𝐵𝑅 Se 𝐴))
64, 5syl 17 . 2 (𝐴 = 𝐵 → (𝑅 Se 𝐵𝑅 Se 𝐴))
73, 6impbid 215 1 (𝐴 = 𝐵 → (𝑅 Se 𝐴𝑅 Se 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1543  wss 3853   Se wse 5492
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-tru 1546  df-ex 1788  df-nf 1792  df-sb 2073  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ral 3056  df-rab 3060  df-v 3400  df-in 3860  df-ss 3870  df-se 5495
This theorem is referenced by:  oieq2  9107
  Copyright terms: Public domain W3C validator