Induction on the number of elements of the domain: maps on a one-point set are the image of the target, and maps on a set with one extra point are the image of the finite product of the smaller map set with the target under extension; a constant map shows nonemptiness.
Each result cited is universally quantified over the data in its own statement.
Since is nonempty and finite, it has elements for some , and we may fix .
Nonemptiness. For every set the constant map with value belongs to , so is nonempty.
A preliminary remark. The initial segment is by claim 2 of Basic Properties of Initial Segments of the Natural Numbers. Hence a set with element is for , where is a bijection.
Finiteness, by induction. Let be the set of those such that is finite for every set with elements. We show by the principle of induction Principle of Induction for the Natural Numbers.
. Let have element; by the remark . For let be the map sending to . The map is surjective, because every equals , the two maps having the same value at the only point of . Since has elements, claim 4 of Basic Properties of Finite Sets shows that has elements for some , so it is finite by Finite Set.
If then . Let have elements. By claim 2 of Peeling an Element off a Finite Set, and Unions of Finite Sets there are a subset with elements and with and . Since , the set is finite, and it is nonempty by the first paragraph. By claim 1 of Finiteness of Cartesian Products, Tuple Sets, and Permutation Sets the Cartesian product is finite; it contains the pair of the constant map with value and , so it is nonempty and has elements for some . For and let be the map whose value at is and whose value at is ; this is well defined because and . The map is surjective: for , let be the restriction of to ; then and agree at every point of and at , so they are equal. By claim 4 of Basic Properties of Finite Sets, has elements for some , so it is finite by Finite Set. Thus .
By Principle of Induction for the Natural Numbers, .
Conclusion. The given is nonempty and finite, so by Finite Set it has elements for some . Since , is finite, and it is nonempty by the first paragraph. This proves (Finiteness).
Loading…