| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > npss0 | Structured version Visualization version GIF version | ||
| Description: No set is a proper subset of the empty set. Dual of nvpss 4373. (Contributed by NM, 17-Jun-1998.) (Proof shortened by Andrew Salmon, 26-Jun-2011.) (Proof shortened by JJ, 14-Jul-2021.) |
| Ref | Expression |
|---|---|
| npss0 | ⊢ ¬ 𝐴 ⊊ ∅ |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ss 4360 | . 2 ⊢ ∅ ⊆ 𝐴 | |
| 2 | ssnpss 4064 | . 2 ⊢ (∅ ⊆ 𝐴 → ¬ 𝐴 ⊊ ∅) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ ¬ 𝐴 ⊊ ∅ |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ⊆ wss 3908 ⊊ wpss 3909 ∅c0 4289 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-dif 3911 df-ss 3925 df-pss 3928 df-nul 4290 |
| This theorem is used by: pssnn 9163 pssn0 43039 |
| Copyright terms: Public domain | W3C validator |