| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nnex | Unicode version | ||
| Description: The set of positive integers exists. (Contributed by NM, 3-Oct-1999.) (Revised by Mario Carneiro, 17-Nov-2014.) |
| Ref | Expression |
|---|---|
| nnex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cnex 8303 |
. 2
| |
| 2 | nnsscn 9309 |
. 2
| |
| 3 | 1, 2 | ssexi 4271 |
1
|
| Colors of variables: wff set class |
| This proof depends on syntax axioms:
|
| 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 4249 ax-cnex 8270 ax-resscn 8271 ax-1re 8273 ax-addrcl 8276 |
| 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 9305 |
| This theorem is used by: nn0ex 9569 nn0ennn 10870 climrecvg1n 12114 climcvg1nlem 12115 divcnv 12264 trireciplem 12267 expcnvap0 12269 expcnv 12271 geo2lim 12283 prmex 12891 qnumval 12963 qdenval 12964 oddennn 13283 evenennn 13284 xpnnen 13285 znnen 13289 qnnen 13322 ssnnctlemct 13337 nninfdc 13344 ndxarg 13375 mulgnngzsum 13930 pellexlem3 16093 trilpo 17092 redcwlpo 17105 nconstwlpo 17116 neapmkv 17118 |
| Copyright terms: Public domain | W3C validator |