Prove, using the Countable Principle of Choice, that every countable subset of has an upper bound in .
Notation: denotes the first uncountable ordinal.
Last edited by selenne431; March 6th 2010 at 03:28 PM.
Follow Math Help Forum on Facebook and Google+
Hint: With the countable principle of choice, a countable union of countable sets is also countable.
View Tag Cloud