DMCA
The fundamental properties of natural numbers (1989)
Cached
Download Links
| Venue: | Journal of Formalized Mathematics |
| Citations: | 680 - 73 self |
BibTeX
@ARTICLE{Bancerek89thefundamental,
author = {Grzegorz Bancerek},
title = {The fundamental properties of natural numbers},
journal = {Journal of Formalized Mathematics},
year = {1989},
volume = {1},
pages = {1--1}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.html The articles [4], [6], [1], [2], [5], and [3] provide the notation and terminology for this paper. A natural number is an element of N. For simplicity, we use the following convention: x is a real number, k, l, m, n are natural numbers, h, i, j are natural numbers, and X is a subset of R. The following proposition is true (2) 1 For every X such that 0 ∈ X and for every x such that x ∈ X holds x+1 ∈ X and for every k holds k ∈ X. Let n, k be natural numbers. Then n+k is a natural number. Let n, k be natural numbers. Note that n+k is natural. In this article we present several logical schemes. The scheme Ind concerns a unary predicate P, and states that: For every natural number k holdsP[k] provided the parameters satisfy the following conditions: • P[0], and • For every natural number k such thatP[k] holdsP[k+1]. The scheme Nat Ind concerns a unary predicateP, and states that: For every natural number k holdsP[k] provided the following conditions are satisfied: • P[0], and • For every natural number k such thatP[k] holdsP[k+1]. Let n, k be natural numbers. Then n · k is a natural number. Let n, k be natural numbers. Observe that n · k is natural. Next we state several propositions: (18) 2 0 ≤ i. (19) If 0 � = i, then 0 < i. (20) If i ≤ j, then i · h ≤ j · h. 1 The proposition (1) has been removed. 2 The propositions (3)–(17) have been removed.
Keyphrases
natural number fundamental property natural number thatp holdsp following condition natural number holdsp scheme ind euclid algorithm mml identifier unary predicatep scheme nat ind exact division real number order relation common divisor unary predicate following proposition common multiple present several logical scheme state several proposition following convention org jfm vol1 nat_1
