axiom of countable choice
(that is, the Zermelo-Fraenkel axioms together with the Axiom of Countable Choice) suffices to prove that the union of countably many countable sets is countable. It also suffices to prove that every infinite set has a countably infinite subset, and that a set is infinite if and only if there is a bijection between and a proper subset of .
|Title||axiom of countable choice|
|Date of creation||2013-03-22 14:46:23|
|Last modified on||2013-03-22 14:46:23|
|Last modified by||yark (2760)|
|Synonym||countable axiom of choice|