H. L. Royden著『Real Analysis Third Edition』

やっとまともな問題に出会いました。

Problem 32.
Let Y be the set of ordinals less than the first uncountable ordinal; i.e., Y = {x ∈ X : x < Ω}. Show that every countable subset E of Y has an upper bound in Y and hence a least upper bound.