|   | 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 9684 | . 2 ⊢ ω ∈ V | |
| 2 | df-ni 10913 | . . 3 ⊢ N = (ω ∖ {∅}) | |
| 3 | difss 4135 | . . 3 ⊢ (ω ∖ {∅}) ⊆ ω | |
| 4 | 2, 3 | eqsstri 4029 | . 2 ⊢ N ⊆ ω | 
| 5 | 1, 4 | ssexi 5321 | 1 ⊢ N ∈ V | 
| Colors of variables: wff setvar class | 
| Syntax hints: ∈ wcel 2107 Vcvv 3479 ∖ cdif 3947 ∅c0 4332 {csn 4625 ωcom 7888 Ncnpi 10885 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pr 5431 ax-un 7756 ax-inf2 9682 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2714 df-cleq 2728 df-clel 2815 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3436 df-v 3481 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-br 5143 df-opab 5205 df-tr 5259 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-om 7889 df-ni 10913 | 
| This theorem is referenced by: enqex 10963 nqex 10964 | 
| Copyright terms: Public domain | W3C validator |