Abstract

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.

Citations

1274	Tarski Grothendieck set theory - Trybulec - 1989
1237	Functions and their basic properties - Byliński - 1989
1164	Properties of subsets - Trybulec - 1989
991	Functions from a set to a set - Byliński - 1989
971	Relations and their basic properties - Woronowicz - 1989
633	The fundamental properties of natural numbers - Bancerek - 1989
616	Cardinal numbers - Bancerek - 1989
370	Subsets of real numbers - Trybulec
301	Finite sets - Darmochwał - 1989
18	Non-contiguous substrings and one-to-one finite sequences - Trybulec - 1990