| 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 9528 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10755 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4084 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 3979 | . 2 ⊢ N ⊆ ω |
| 5 | 1, 4 | ssexi 5258 | 1 ⊢ N ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2110 Vcvv 3434 ∖ cdif 3897 ∅c0 4281 {csn 4574 ωcom 7791 Ncnpi 10727 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-ext 2702 ax-sep 5232 ax-nul 5242 ax-pr 5368 ax-un 7663 ax-inf2 9526 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2722 df-clel 2804 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3394 df-v 3436 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-br 5090 df-opab 5152 df-tr 5197 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-we 5569 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-om 7792 df-ni 10755 |
| This theorem is referenced by: enqex 10805 nqex 10806 |
| Copyright terms: Public domain | W3C validator |