In a metric space, a cluster point of a sequence $\{x_n\}$ is the limit of some subsequence. The only proof that I know works like this:
Construct a sequence $\delta _k \to 0$. For each $\delta _k$ find a point $x_{n_k}$ in the sequence which is within $\delta_k$ of the cluster point. Make sure that $n_{k} \lt n_{k+1}$, so that you really have a subsequence, and you can do this because there are only finitely many terms before index $n_{k}$.
Question: Is this using Countable Choice? If so is it because we're "picking" a sequence element for each $\delta_k$? If we are using Countable Choice, then is there a way to prove this without using CC?
I apologize if this is a duplicate question - I know there have been previous posts where it's explained why Sequential Continuity Implies $\delta - \epsilon$ Continuity requires Countable Choice. The argument used in that proof seems similar to this one.
Thank you very much.