Results 1  10
of
499
Functions from a set to a set
 Journal of Formalized Mathematics
, 1989
"... function from a set X into a set Y, denoted by “Function of X,Y ”, the set of all functions from a set X into a set Y, denoted by Funcs(X,Y), and the permutation of a set (mode Permutation of X, where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1] ..."
Abstract

Cited by 1007 (23 self)
 Add to MetaCart
function from a set X into a set Y, denoted by “Function of X,Y ”, the set of all functions from a set X into a set Y, denoted by Funcs(X,Y), and the permutation of a set (mode Permutation of X, where X is a set). Theorems and schemes included in the article are reformulations of the theorems of [1] in the new terminology. Also some basic facts about functions of two variables are proved.
The ordinal numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem and oth ..."
Abstract

Cited by 627 (63 self)
 Add to MetaCart
Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem and other properties of order relation of cardinals. In the second section we show that every set has cardinal number equipotence to it. We introduce notion of alephs and we deal with the concept of finite set. At the end of the article we show two schemes of cardinal induction. Some definitions are based on [9] and [10].
Partial Functions
"... this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following rules ..."
Abstract

Cited by 426 (10 self)
 Add to MetaCart
this article we prove some auxiliary theorems and schemes related to the articles: [1] and [2]. MML Identifier: PARTFUN1. WWW: http://mizar.org/JFM/Vol1/partfun1.html The articles [4], [6], [3], [5], [7], [8], and [1] provide the notation and terminology for this paper. We adopt the following rules: x, y, y 1 , y 2 , z, z 1 , z 2 denote sets, P , Q, X , X 0 , X 1 , X 2 , Y , Y 0 , Y 1 , Y 2 , V , Z denote sets, and C, D denote non empty sets. We now state three propositions: (1) If P ` [: X 1
Binary operations
 Journal of Formalized Mathematics
, 1989
"... Summary. In this paper we define binary and unary operations on domains. We also define the following predicates concerning the operations:... is commutative,... is associative,... is the unity of..., and... is distributive wrt.... A number of schemes useful in justifying the existence of the operat ..."
Abstract

Cited by 330 (6 self)
 Add to MetaCart
Summary. In this paper we define binary and unary operations on domains. We also define the following predicates concerning the operations:... is commutative,... is associative,... is the unity of..., and... is distributive wrt.... A number of schemes useful in justifying the existence of the operations are proved. MML Identifier:BINOP_1. WWW:http://mizar.org/JFM/Vol1/binop_1.html The articles [4], [3], [5], [6], [1], and [2] provide the notation and terminology for this paper. Let f be a function and let a, b be sets. The functor f(a, b) yielding a set is defined by: (Def. 1) f(a, b) = f(〈a, b〉). In the sequel A is a set. Let A, B be non empty sets, let C be a set, let f be a function from [:A, B:] into C, let a be an element of A, and let b be an element of B. Then f(a, b) is an element of C. The following proposition is true (2) 1 Let A, B, C be non empty sets and f1, f2 be functions from [:A, B:] into C. Suppose that for every element a of A and for every element b of B holds f1(a, b) = f2(a, b). Then f1 = f2. Let A be a set. A unary operation on A is a function from A into A. A binary operation on A is a
Finite sets
 Journal of Formalized Mathematics
, 1989
"... Summary. The article contains the definition of a finite set based on the notion of finite sequence. Some theorems about properties of finite sets and finite families of sets are proved. ..."
Abstract

Cited by 310 (6 self)
 Add to MetaCart
Summary. The article contains the definition of a finite set based on the notion of finite sequence. Some theorems about properties of finite sets and finite families of sets are proved.
Finite Sequences and Tuples of Elements of a Nonempty 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 nonempty set D and it is denoted by element of D ..."
Abstract

Cited by 291 (7 self)
 Add to MetaCart
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 nonempty set D and it is denoted by element of D
Pigeon hole principle
 Journal of Formalized Mathematics
, 1990
"... Summary. We introduce the notion of a predicate that states that a function is onetoone 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 262 (13 self)
 Add to MetaCart
Summary. We introduce the notion of a predicate that states that a function is onetoone 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.
Binary operations applied to functions
 Journal of Formalized Mathematics
, 1989
"... Summary. In the article we introduce functors yielding to a binary operation its composition with an arbitrary functions on its left side, its right side or both. We prove theorems describing the basic properties of these functors. We introduce also constant functions and converse of a function. The ..."
Abstract

Cited by 256 (43 self)
 Add to MetaCart
Summary. In the article we introduce functors yielding to a binary operation its composition with an arbitrary functions on its left side, its right side or both. We prove theorems describing the basic properties of these functors. We introduce also constant functions and converse of a function. The recent concept is defined for an arbitrary function, however is meaningful in the case of functions which range is a subset of a Cartesian product of two sets. Then the converse of a function has the same domain as the function itself and assigns to an element of the domain the mirror image of the ordered pair assigned by the function. In the case of functions defined on a nonempty set we redefine the above mentioned functors and prove simplified versions of theorems proved in the general case. We prove also theorems stating relationships between introduced concepts and such properties of binary operations as commutativity or associativity.
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 250 (21 self)
 Add to MetaCart
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