![]() |
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 7768 |
. 2
![]() ![]() ![]() ![]() | |
2 | nnsscn 8749 |
. 2
![]() ![]() ![]() ![]() | |
3 | 1, 2 | ssexi 4074 |
1
![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-sep 4054 ax-cnex 7735 ax-resscn 7736 ax-1re 7738 ax-addrcl 7741 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ral 2422 df-v 2691 df-in 3082 df-ss 3089 df-int 3780 df-inn 8745 |
This theorem is referenced by: nn0ex 9007 nn0ennn 10237 climrecvg1n 11149 climcvg1nlem 11150 divcnv 11298 trireciplem 11301 expcnvap0 11303 expcnv 11305 geo2lim 11317 prmex 11830 qnumval 11899 qdenval 11900 oddennn 11941 evenennn 11942 xpnnen 11943 znnen 11947 qnnen 11980 ndxarg 12021 trilpo 13411 redcwlpo 13422 neapmkv 13425 |
Copyright terms: Public domain | W3C validator |