| 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 9600 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10832 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4091 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 3984 | . 2 ⊢ N ⊆ ω |
| 5 | 1, 4 | ssexi 5280 | 1 ⊢ N ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2144 Vcvv 3456 ∖ cdif 3903 ∅c0 4287 {csn 4584 ωcom 7848 Ncnpi 10804 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pr 5392 ax-un 7720 ax-inf2 9598 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-sb 2093 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-tr 5210 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-om 7849 df-ni 10832 |
| This theorem is referenced by: enqex 10882 nqex 10883 |
| Copyright terms: Public domain | W3C validator |