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

Theorem npss0 4369
Description: No set is a proper subset of the empty set. Dual of nvpss 4371. (Contributed by NM, 17-Jun-1998.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) (Proof shortened by JJ, 14-Jul-2021.)
Assertion
Ref Expression
npss0 ¬ 𝐴 ⊊ ∅

Proof of Theorem npss0
StepHypRef Expression
1 0ss 4358 . 2 ∅ ⊆ 𝐴
2 ssnpss 4062 . 2 (∅ ⊆ 𝐴 → ¬ 𝐴 ⊊ ∅)
31, 2ax-mp 5 1 ¬ 𝐴 ⊊ ∅
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wss 3906  wpss 3907  c0 4287
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-dif 3909  df-ss 3923  df-pss 3926  df-nul 4288
This theorem is referenced by:  pssnn  9154  pssn0  42979
  Copyright terms: Public domain W3C validator