| 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 8134 | . 2 ⊢ ℂ ∈ V | |
| 2 | nnsscn 9126 | . 2 ⊢ ℕ ⊆ ℂ | |
| 3 | 1, 2 | ssexi 4222 | 1 ⊢ ℕ ∈ V |
| Colors of variables: wff set class |
| Syntax hints: ∈ wcel 2200 Vcvv 2799 ℂcc 8008 ℕcn 9121 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 ax-sep 4202 ax-cnex 8101 ax-resscn 8102 ax-1re 8104 ax-addrcl 8107 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-v 2801 df-in 3203 df-ss 3210 df-int 3924 df-inn 9122 |
| This theorem is referenced by: nn0ex 9386 nn0ennn 10667 climrecvg1n 11874 climcvg1nlem 11875 divcnv 12023 trireciplem 12026 expcnvap0 12028 expcnv 12030 geo2lim 12042 prmex 12650 qnumval 12722 qdenval 12723 oddennn 12978 evenennn 12979 xpnnen 12980 znnen 12984 qnnen 13017 ssnnctlemct 13032 nninfdc 13039 ndxarg 13070 mulgnngsum 13679 trilpo 16471 redcwlpo 16483 nconstwlpo 16494 neapmkv 16496 |
| Copyright terms: Public domain | W3C validator |