| 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 9615 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10860 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4098 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 3991 | . 2 ⊢ N ⊆ ω |
| 5 | 1, 4 | ssexi 5296 | 1 ⊢ N ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2150 Vcvv 3462 ∖ cdif 3910 ∅c0 4294 {csn 4594 ωcom 7865 Ncnpi 10832 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pr 5408 ax-un 7736 ax-inf2 9613 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-ne 2966 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-tr 5224 df-eprel 5565 df-po 5573 df-so 5574 df-fr 5618 df-we 5620 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-om 7866 df-ni 10860 |
| This theorem is referenced by: enqex 10910 nqex 10911 |
| Copyright terms: Public domain | W3C validator |