Results 1 - 10
of
731
The fundamental properties of natural numbers
- Journal of Formalized Mathematics
, 1989
"... 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.h ..."
Abstract
-
Cited by 688 (73 self)
- Add to MetaCart
(Show Context)
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.
Basic Properties of Real Numbers
- Journal of Formalized Mathematics
, 1989
"... this paper. A real number is an element of R ..."
(Show Context)
Finite Sequences and Tuples of Elements of a Non-empty Sets
, 1990
"... this article is the definition of tuples. The element of a set of all sequences of the length n of D is called a tuple of a non-empty set D and it is denoted by element of D ..."
Abstract
-
Cited by 332 (7 self)
- Add to MetaCart
(Show Context)
this article is the definition of tuples. The element of a set of all sequences of the length n of D is called a tuple of a non-empty set D and it is denoted by element of D
Basis of Real Linear Space
, 1990
"... this paper. For simplicity, we follow the rules: x is a set, a, b are real numbers, V is a real linear space, W 1 , W 2 , W 3 are subspaces of V , v, v 1 , v 2 are vectors of V , A, B are subsets of the carrier of V , L, L 1 , L 2 are linear combinations of V , l is a linear combination of A, F , G ..."
Abstract
-
Cited by 285 (21 self)
- Add to MetaCart
(Show Context)
this paper. For simplicity, we follow the rules: x is a set, a, b are real numbers, V is a real linear space, W 1 , W 2 , W 3 are subspaces of V , v, v 1 , v 2 are vectors of V , A, B are subsets of the carrier of V , L, L 1 , L 2 are linear combinations of V , l is a linear combination of A, F , G
Pigeon hole principle
- Journal of Formalized Mathematics
, 1990
"... Summary. We introduce the notion of a predicate that states that a function is one-toone at a given element of its domain (i.e. counterimage of image of the element is equal to its singleton). We also introduce some rather technical functors concerning finite sequences: the lowest index of the given ..."
Abstract
-
Cited by 261 (13 self)
- Add to MetaCart
(Show Context)
Summary. We introduce the notion of a predicate that states that a function is one-toone at a given element of its domain (i.e. counterimage of image of the element is equal to its singleton). We also introduce some rather technical functors concerning finite sequences: the lowest index of the given element of the range of the finite sequence, the substring preceding (and succeeding) the first occurrence of given element of the range. At the end of the article we prove the pigeon hole principle.
The Reflection Theorem
- Journal of Formalized Mathematics
, 1990
"... this paper (and in another Mizar articles) we work in Tarski-Grothendieck (TG) theory (see [17]) which ensures the existence of sets that have properties like universal class (i.e. this theory is stronger than MK). The sets are introduced in [15] and some concepts of MK are modeled. The concepts are ..."
Abstract
-
Cited by 249 (51 self)
- Add to MetaCart
this paper (and in another Mizar articles) we work in Tarski-Grothendieck (TG) theory (see [17]) which ensures the existence of sets that have properties like universal class (i.e. this theory is stronger than MK). The sets are introduced in [15] and some concepts of MK are modeled. The concepts are: the class On of all ordinal numbers belonging to the universe, subclasses, transfinite sequences of non-empty elements of universe, etc. The reflection theorem states that if A ¸ is an increasing and continuous transfinite sequence of non-empty sets and class A =
Many-sorted sets
- Journal of Formalized Mathematics
, 1993
"... Summary. The article deals with parameterized families of sets. When treated in a similar way as sets (due to systematic overloading notation used for sets) they are called many sorted sets. For instance, if x and X are two many-sorted sets (with the same set of indices I) then relation x ∈ X is def ..."
Abstract
-
Cited by 189 (23 self)
- Add to MetaCart
(Show Context)
Summary. The article deals with parameterized families of sets. When treated in a similar way as sets (due to systematic overloading notation used for sets) they are called many sorted sets. For instance, if x and X are two many-sorted sets (with the same set of indices I) then relation x ∈ X is defined as ∀i∈Ixi ∈ Xi. I was prompted by a remark in a paper by Tarlecki and Wirsing: “Throughout the paper we deal with many-sorted sets, functions, relations etc.... We feel free to use any standard set-theoretic notation without explicit use of indices ” [6, p. 97]. The aim of this work was to check the feasibility of such approach in Mizar. It works. Let us observe some peculiarities:- empty set (i.e. the many sorted set with empty set of indices) belongs to itself (theorem 133),- we get two different inclusions X ⊆ Y iff ∀i∈IXi ⊆ Yi and X ⊑ Y iff ∀xx ∈ X ⇒ x ∈ Y equivalent only for sets that yield non empty values. Therefore the care is advised.
The sum and product of finite sequences of real numbers.
- Formalized Mathematics,
, 1990
"... ..."
(Show Context)
Convergent sequences and the limit of sequences.
- Formalized Mathematics,
, 1990
"... ..."
(Show Context)