| 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 9596 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10825 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4099 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 3993 | . 2 ⊢ N ⊆ ω |
| 5 | 1, 4 | ssexi 5277 | 1 ⊢ N ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2109 Vcvv 3447 ∖ cdif 3911 ∅c0 4296 {csn 4589 ωcom 7842 Ncnpi 10797 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 ax-un 7711 ax-inf2 9594 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-tr 5215 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-om 7843 df-ni 10825 |
| This theorem is referenced by: enqex 10875 nqex 10876 |
| Copyright terms: Public domain | W3C validator |