MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  df-nn Structured version   Visualization version   Unicode version

Definition df-nn 11021
Description: Define the set of positive integers. Some authors, especially in analysis books, call these the natural numbers, whereas other authors choose to include 0 in their definition of natural numbers. Note that  NN is a subset of complex numbers (nnsscn 11025), in contrast to the more elementary ordinal natural numbers  om, df-om 7066). See nnind 11038 for the principle of mathematical induction. See df-n0 11293 for the set of nonnegative integers  NN0. See dfn2 11305 for  NN defined in terms of  NN0.

This is a technical definition that helps us avoid the Axiom of Infinity ax-inf2 8538 in certain proofs. For a more conventional and intuitive definition ("the smallest set of reals containing  1 as well as the successor of every member") see dfnn3 11034 (or its slight variant dfnn2 11033). (Contributed by NM, 10-Jan-1997.) (Revised by Mario Carneiro, 3-May-2014.)

Assertion
Ref Expression
df-nn  |-  NN  =  ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  1 ) " om )

Detailed syntax breakdown of Definition df-nn
StepHypRef Expression
1 cn 11020 . 2  class  NN
2 vx . . . . 5  setvar  x
3 cvv 3200 . . . . 5  class  _V
42cv 1482 . . . . . 6  class  x
5 c1 9937 . . . . . 6  class  1
6 caddc 9939 . . . . . 6  class  +
74, 5, 6co 6650 . . . . 5  class  ( x  +  1 )
82, 3, 7cmpt 4729 . . . 4  class  ( x  e.  _V  |->  ( x  +  1 ) )
98, 5crdg 7505 . . 3  class  rec (
( x  e.  _V  |->  ( x  +  1
) ) ,  1 )
10 com 7065 . . 3  class  om
119, 10cima 5117 . 2  class  ( rec ( ( x  e. 
_V  |->  ( x  + 
1 ) ) ,  1 ) " om )
121, 11wceq 1483 1  wff  NN  =  ( rec ( ( x  e.  _V  |->  ( x  +  1 ) ) ,  1 ) " om )
Colors of variables: wff setvar class
This definition is referenced by:  nnexALT  11022  peano5nni  11023  1nn  11031  peano2nn  11032
  Copyright terms: Public domain W3C validator