| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > niex | Structured version Visualization version GIF version | ||
| Description: The class of positive integers is a set. (Contributed by NM, 15-Aug-1995.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| niex | ⊢ N ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | omex 9668 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10981 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4075 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 3959 | . 2 ⊢ N ⊆ ω |
| 5 | 1, 4 | ssexi 5288 | 1 ⊢ N ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2147 Vcvv 3454 ∖ cdif 4048 ∅c0 4281 {csn 4588 ωcom 7898 Ncnpi 10953 |
| 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 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7772 ax-inf2 9666 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 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-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-tr 5216 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-ord 6380 df-on 6381 df-lim 6382 df-suc 6383 df-om 7899 df-ni 10981 |
| This theorem is used by: enqex 11031 nqex 11032 |
| Copyright terms: Public domain | W3C validator |