Axiom of countable choice

Each set in the countable sequence of sets (Si) = S1, S2, S3, ... contains a non-zero, and possibly infinite (or even uncountably infinite), number of elements. The axiom of countable choice allows us to arbitrarily select a single element from each set, forming a corresponding sequence of elements (xi) = x1, x2, x3, ...

The axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory that states that every countable collection of non-empty sets must have a choice function. That is, given a function with domain (where denotes the set of natural numbers) such that is a non-empty set for every , there exists a function with domain such that for every .