According to the definition of integers, we can represent any integer \(x\) by two natural numbers \(a,b\), formally \(x=[a,b]\). In order to avoid too many different cases, we can assume without loss of generality at least one of these natural numbers to be equal zero. There are three different possibilities to have two natural numbers, at least one being equal to zero: \([a,0],[0,0]\) or \([0,a]\) for some natural number \(a > 0\).
Therefore, based on the order relation for natural numbers, we call an integer $x$
for some natural number \(a > 0\).
Based on the definition of subtraction of integers, we can define the order relation for integers as follows:
Algorithms: 1 2 3
Chapters: 4
Corollaries: 5 6
Definitions: 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
Explanations: 23 24
Lemmas: 25 26
Motivations: 27 28
Parts: 29
Proofs: 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63
Propositions: 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87
Sections: 88 89 90
Theorems: 91 92 93
In all three cases, the first $0$ is the integer zero and the $0$ in the brackets means the natural zero. ↩
