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

Theorem npss0 4397
Description: No set is a proper subset of the empty set. (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 4349 . 2 ∅ ⊆ 𝐴
2 ssnpss 4055 . 2 (∅ ⊆ 𝐴 → ¬ 𝐴 ⊊ ∅)
31, 2ax-mp 5 1 ¬ 𝐴 ⊊ ∅
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wss 3898  wpss 3899  c0 4282
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ne 2930  df-dif 3901  df-ss 3915  df-pss 3918  df-nul 4283
This theorem is referenced by:  pssnn  9087  pssn0  42348
  Copyright terms: Public domain W3C validator