| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnex | GIF version | ||
| Description: The set of positive integers exists. (Contributed by NM, 3-Oct-1999.) (Revised by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| nnex | ⊢ ℕ ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnex 8309 | . 2 ⊢ ℂ ∈ V | |
| 2 | nnsscn 9318 | . 2 ⊢ ℕ ⊆ ℂ | |
| 3 | 1, 2 | ssexi 4273 | 1 ⊢ ℕ ∈ V |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: ∈ wcel 2209 Vcvv 2821 ℂcc 8183 ℕcn 9313 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 ax-sep 4251 ax-cnex 8276 ax-resscn 8277 ax-1re 8279 ax-addrcl 8282 |
| This proof depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-v 2823 df-in 3226 df-ss 3233 df-int 3971 df-inn 9314 |
| This theorem is used by: nn0ex 9580 nn0ennn 10891 climrecvg1n 12139 climcvg1nlem 12140 divcnv 12289 trireciplem 12292 expcnvap0 12294 expcnv 12296 geo2lim 12308 prmex 12916 qnumval 12990 qdenval 12991 oddennn 13341 evenennn 13342 xpnnen 13343 znnen 13347 qnnen 13380 ssnnctlemct 13395 nninfdc 13402 ndxarg 13433 mulgnngzsum 13989 pellexlem3 16231 trilpo 17299 redcwlpo 17312 nconstwlpo 17323 neapmkv 17325 |
| Copyright terms: Public domain | W3C validator |