| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0npi | Structured version Visualization version GIF version | ||
| Description: The empty set is not a positive integer. (Contributed by NM, 26-Aug-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 0npi | ⊢ ¬ ∅ ∈ N |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . 2 ⊢ ∅ = ∅ | |
| 2 | elni 10932 | . . . 4 ⊢ (∅ ∈ N ↔ (∅ ∈ ω ∧ ∅ ≠ ∅)) | |
| 3 | 2 | simprbi 503 | . . 3 ⊢ (∅ ∈ N → ∅ ≠ ∅) |
| 4 | 3 | necon2bi 2985 | . 2 ⊢ (∅ = ∅ → ¬ ∅ ∈ N) |
| 5 | 1, 4 | ax-mp 5 | 1 ⊢ ¬ ∅ ∈ N |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ∅c0 4278 ωcom 7860 Ncnpi 10900 |
| 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-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-v 3452 df-dif 3901 df-sn 4584 df-ni 10928 |
| This theorem is used by: addasspi 10951 mulasspi 10953 distrpi 10954 addcanpi 10955 mulcanpi 10956 addnidpi 10957 ltapi 10959 ltmpi 10960 ordpipq 10998 |
| Copyright terms: Public domain | W3C validator |