An injection from [m] to [n] forces m ≤ n, so a finite set is listed by exactly one [n]; subsets, unions, Cartesian products, images and sets of maps of finite sets are finite, as are finite unions of finite sets; a set of natural numbers with zero is finite exactly when it is bounded above; every nonempty finite subset of a totally ordered set has a greatest and a least element; and a finite family of nonempty sets has a choice map, without any axiom of choice.
In the setting of The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion, let finite sets be as in Finite Sets §finite, intervals and as in Intervals of Natural Numbers §interval and Intervals of Natural Numbers §segment, and let and be sets.
Let . If there is an injective map from to , then ; if there is a bijection from onto , then .
If is finite, there is exactly one for which there is a bijection from onto .
is finite, and is finite for every set .
If is finite, every subset of is finite.
If and are finite, then and are finite.
If is finite and is a map, then is finite.
A subset of is finite if and only if there is with for every ; in particular every interval with is finite.
Let be a total order on a set . Every nonempty finite subset of has a greatest element and a least element, and of Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §least.
If and are finite, then the set of maps from to is finite; if moreover , then .
Let now be a finite set and a family of sets, with union as in Indexed Families of Sets and Their Union, Intersection and Product §union, a set by The Union and Product of a Family of Sets Indexed by a Set, and the Intersection of a Family with an Inhabited Index Class, Are Sets §union.
If is finite for every , then is finite.
If for every , then there is a map with for every .
Loading…
No relations recorded yet.