| 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 9610 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10863 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4089 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 3982 | . 2 ⊢ N ⊆ ω |
| 5 | 1, 4 | ssexi 5292 | 1 ⊢ N ∈ V |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2142 Vcvv 3454 ∖ cdif 3901 ∅c0 4285 {csn 4588 ωcom 7860 Ncnpi 10835 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-un 7734 ax-inf2 9608 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-tr 5218 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-om 7861 df-ni 10863 |
| This theorem is used by: enqex 10913 nqex 10914 |
| Copyright terms: Public domain | W3C validator |