| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0pss | Structured version Visualization version GIF version | ||
| Description: The empty set is a proper subset of any nonempty set. Dual of pssv 4368. (Contributed by NM, 27-Feb-1996.) |
| Ref | Expression |
|---|---|
| 0pss | ⊢ (∅ ⊊ 𝐴 ↔ 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ss 4356 | . . 3 ⊢ ∅ ⊆ 𝐴 | |
| 2 | df-pss 3924 | . . 3 ⊢ (∅ ⊊ 𝐴 ↔ (∅ ⊆ 𝐴 ∧ ∅ ≠ 𝐴)) | |
| 3 | 1, 2 | mpbiran 721 | . 2 ⊢ (∅ ⊊ 𝐴 ↔ ∅ ≠ 𝐴) |
| 4 | necom 3010 | . 2 ⊢ (∅ ≠ 𝐴 ↔ 𝐴 ≠ ∅) | |
| 5 | 3, 4 | bitri 278 | 1 ⊢ (∅ ⊊ 𝐴 ↔ 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ≠ wne 2957 ⊆ wss 3904 ⊊ wpss 3905 ∅c0 4285 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-dif 3907 df-ss 3921 df-pss 3924 df-nul 4286 |
| This theorem is used by: php 9189 zornn0g 10495 prn0 10980 genpn0 10994 nqpr 11005 ltexprlem5 11031 reclem2pr 11039 suplem1pr 11043 alexsubALTlem4 24218 bj-2upln0 37687 bj-2upln1upl 37688 0pssin 44525 |
| Copyright terms: Public domain | W3C validator |