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

Theorem nssss 5426
Description: Negation of subclass relationship. Compare nss 4003. (Contributed by NM, 30-Jun-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
nssss 𝐴𝐵 ↔ ∃𝑥(𝑥𝐴 ∧ ¬ 𝑥𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nssss
StepHypRef Expression
1 exanali 1882 . . 3 (∃𝑥(𝑥𝐴 ∧ ¬ 𝑥𝐵) ↔ ¬ ∀𝑥(𝑥𝐴𝑥𝐵))
2 ssextss 5424 . . 3 (𝐴𝐵 ↔ ∀𝑥(𝑥𝐴𝑥𝐵))
31, 2xchbinxr 338 . 2 (∃𝑥(𝑥𝐴 ∧ ¬ 𝑥𝐵) ↔ ¬ 𝐴𝐵)
43bicomi 227 1 𝐴𝐵 ↔ ∃𝑥(𝑥𝐴 ∧ ¬ 𝑥𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 400  wal 1561  wex 1802  wss 3907
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5250  ax-pr 5394
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1566  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-v 3459  df-un 3912  df-ss 3924  df-pw 4560  df-sn 4586  df-pr 4588
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator