This is another question related to Cohen's Discovery of Forcing:
Consider the following passage from p. 1091:
Suppose $M$ were a countable model. Up until now we have not discussed the role countability might play. This means that all the sets of $M$ are countable, although the enumeration of some sets of $M$ does not exist in $M$. The simplest example would be the uncountable ordinals in $M$. These of course are actually countable ordinals, and hence there is an ordinal $I$, not in $M$, which is countable, and which is larger than all the ordinals of $M$.
What I understand: If $M$ is countable it cannot contain all countable ordinals since the set of all countable ordinals, $\omega_1$, is uncountable. Hence there exists at least one countable ordinal $\alpha$ not in $M$.
What I don't understand: Why does it hold that $\alpha$ is bigger than all the countable ordinals in $M$? It seems to me that one could pick countably many countable ordinals $\alpha_n$ so that above any given countable ordinal $\beta$ there is an $\alpha_n$. (I am thinking of the real numbers where the natural numbers would be a countable set such that above any natural number we can find a natural number). But for some reason a construction like this does not work in this case. Why not?
The reason is cofinality. $\omega_1$ is a regular ordinal (at least if we assume choice), so for any countable collection of countable ordinals there is another countable ordinal above all of them.