TheoremBase

Sets of Maps between Finite Sets, Finite Unions of Finite Sets, and Finite Choice

The set of maps between two finite sets is finite, and nonempty when the target is; a finite union of finite sets is finite; and a finite family of nonempty sets has a choice map, without any axiom of choice.

Statement

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, and let AA and BB be sets.

If AA and BB are finite, then the set BAB^{A} of maps from AA to BB is finite; if moreover B≠∅B\neq\emptyset, then BA≠∅B^{A}\neq\emptyset.

Let now II be a finite set and (Ci)i∈I(C_{i})_{i\in I} a family of sets, with union ⋃i∈ICi\bigcup_{i\in I}C_{i} 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 CiC_{i} is finite for every i∈Ii\in I, then ⋃i∈ICi\bigcup_{i\in I}C_{i} is finite.

If Ci≠∅C_{i}\neq\emptyset for every i∈Ii\in I, then there is a map f:I→⋃i∈ICif:I\to\bigcup_{i\in I}C_{i} with f(i)∈Cif(i)\in C_{i} for every i∈Ii\in I.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…