How to show that $S_\Omega$ satisfies the sequence lemma? I am trying to prove this fact, but there is one thing that shows up that makes me unable to finish the proof, do you have any tips on how to finish the proof?
A space X satisfies the sequence lemma if for every subspace A of X.:

If $x \in \bar{A}$ there is a sequence of elements $a_n\in A$
  converging to x.

The space $S_\Omega$ is a space that does not contain a larges element, it is uncountable, it has a smallest element $a_0$, and it is well-ordered. And even though it is uncountable, for all $k \in S_{\Omega}$, the set $\{x < k| x \in S_\Omega\}$ is countable.
The toplogy on $S_\Omega$ is the order topology. (It is called the minimal uncountable well-ordered set).
I want to show that $S_\Omega$ satisfies the sequence lemma.
attempt at proof:
Assume that $x \in \bar{A} \subset S_\Omega$, and lets just assume for simplicity that $x \ne a_0$.
Let (a,b), be a basis element around x, then since $x \in \bar{A}$, this basis element must contain $a_1\in A$. Depending on wheter $a_1$ is bigger or smaller than x, then look at the intervals $(a,a_1)$ or $(a_1,b)$.(If $a_1$ happens to be x, we are done, because then we just get a constant sequence in x.
If we continue this process, we get a sequence $\{a_n\}$ in A. But I do not think we can be sure that it converges to x. Because if it converges to x, then for any basis element around x, we must have that the sequence at one time, stays within this basis element. I think something like this can happen, even though we are not in the real numbers: we want a sequence convering to 0, first look at (-2,2), choose 1, then look at (-2,1), choose 0.9, then look at (-2,0.9), choose 0.89, then look at (-2,0.89), choose 0.889, etc. so we converge to 0.8888..., instead of 0.
Any tips? I can't just divide the intervals, because we do not have a metric on $S_\Omega$. Since we have the countable property it seems I have to use that, but I am not quite sure how to when I do not have a metric.

Using the standard notation: $0$ is the smallest element of $S_\Omega$ and $x+1$ is the smallest element larger than $x$:
Say $x\in\overline A\setminus A$. The fact that $(0,x+1)$ is open shows that $x$ cannot be in the closure of the set of elements of $A$ larger than $x$, hence $x$ is in the closure of the set of elements of $A$ smaller than $x$.
That set is countable; say $(a_n)$ is an enumeration of the elements of $A$ smaller than $x$. Now for each $j$, let $b_j$ be the maximum of $a_1,\dots,a_j$. So $b_j\in A$, $b_j<x$, $b_{j+1}\ge b_j$, and for every  $a$ in $A$ with $a<x$ there exists $j$ with $b_j\ge a$.
It follows that $b_j\to x$. Suppose $y<x$. There exists $a\in A$ with $y<a<x$. There exists $j$ with $a\le b_j<x$, and hence $y<b_k<x$ for all $k\ge j$.
