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

Theorem npss0 4364
Description: No set is a proper subset of the empty set. Dual of nvpss 4366. (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 4353 . 2 ∅ ⊆ 𝐴
2 ssnpss 4037 . 2 (∅ ⊆ 𝐴 → ¬ 𝐴 ⊊ ∅)
31, 2ax-mp 5 1 ¬ 𝐴 ⊊ ∅
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ⊆ wss 3900   ⊊ wpss 4016  ∅c0 4281
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ss 3901  df-pss 4017  df-dif 4050  df-nul 4282
This theorem is used by:  pssnn  9215  pssn0  43485
  Copyright terms: Public domain W3C validator