 Axiom of countable choice

The axiom of countable choice allows one to choose an element from each member of a countable family of nonempty sets. It is a restricted form of the axiom of choice. In the usual proof that a countable union of countable sets is countable, it suffices to choose one enumerating injection for each set; if those enumerations are already supplied, that proof requires no further choice.