| 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 4361. (Contributed by NM, 27-Feb-1996.) |
| Ref | Expression |
|---|---|
| 0pss | ⊢ (∅ ⊊ 𝐴 ↔ 𝐴 ≠ ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0ss 4349 | . . 3 ⊢ ∅ ⊆ 𝐴 | |
| 2 | df-pss 3918 | . . 3 ⊢ (∅ ⊊ 𝐴 ↔ (∅ ⊆ 𝐴 ∧ ∅ ≠ 𝐴)) | |
| 3 | 1, 2 | mpbiran 722 | . 2 ⊢ (∅ ⊊ 𝐴 ↔ ∅ ≠ 𝐴) |
| 4 | necom 3008 | . 2 ⊢ (∅ ≠ 𝐴 ↔ 𝐴 ≠ ∅) | |
| 5 | 3, 4 | bitri 278 | 1 ⊢ (∅ ⊊ 𝐴 ↔ 𝐴 ≠ ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ≠ wne 2955 ⊆ wss 3898 ⊊ wpss 3899 ∅c0 4278 |
| 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 2147 ax-9 2155 ax-ext 2732 |
| 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 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-dif 3901 df-ss 3915 df-pss 3918 df-nul 4279 |
| This theorem is used by: php 9200 zornn0g 10555 prn0 11046 genpn0 11060 nqpr 11071 ltexprlem5 11097 reclem2pr 11105 suplem1pr 11109 alexsubALTlem4 24331 bj-2upln0 37858 bj-2upln1upl 37859 0pssin 44715 |
| Copyright terms: Public domain | W3C validator |