| 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 9554 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10785 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4087 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 3979 | . 2 ⊢ N ⊆ ω |
| 5 | 1, 4 | ssexi 5266 | 1 ⊢ N ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ∈ wcel 2114 Vcvv 3439 ∖ cdif 3897 ∅c0 4284 {csn 4579 ωcom 7808 Ncnpi 10757 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2707 ax-sep 5240 ax-nul 5250 ax-pr 5376 ax-un 7680 ax-inf2 9552 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-ne 2932 df-ral 3051 df-rex 3060 df-rab 3399 df-v 3441 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-tr 5205 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-we 5578 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-om 7809 df-ni 10785 |
| This theorem is referenced by: enqex 10835 nqex 10836 |
| Copyright terms: Public domain | W3C validator |