| 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 8156 | . 2 ⊢ ℂ ∈ V | |
| 2 | nnsscn 9148 | . 2 ⊢ ℕ ⊆ ℂ | |
| 3 | 1, 2 | ssexi 4227 | 1 ⊢ ℕ ∈ V |
| Colors of variables: wff set class |
| Syntax hints: ∈ wcel 2202 Vcvv 2802 ℂcc 8030 ℕcn 9143 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 ax-sep 4207 ax-cnex 8123 ax-resscn 8124 ax-1re 8126 ax-addrcl 8129 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ral 2515 df-v 2804 df-in 3206 df-ss 3213 df-int 3929 df-inn 9144 |
| This theorem is referenced by: nn0ex 9408 nn0ennn 10696 climrecvg1n 11926 climcvg1nlem 11927 divcnv 12076 trireciplem 12079 expcnvap0 12081 expcnv 12083 geo2lim 12095 prmex 12703 qnumval 12775 qdenval 12776 oddennn 13031 evenennn 13032 xpnnen 13033 znnen 13037 qnnen 13070 ssnnctlemct 13085 nninfdc 13092 ndxarg 13123 mulgnngsum 13732 trilpo 16698 redcwlpo 16711 nconstwlpo 16722 neapmkv 16724 |
| Copyright terms: Public domain | W3C validator |