Question on proof that first countable, countable compact space is sequentially compact 
Note. This question concerns steps in a specific proof of the statement from the title, a link to which is (was) provided in the question. That link is now dead, and since the question does not contain all of the information required to accurately answer the question, it will be closed.

I'm reading some notes with a proof that a first countable, countably compact space is sequentially compact. 
On page 118 of these notes (third page of the pdf), they are constructing a convergent subsequence. They state that $B_{n(k)+1}\cap T_{n(k)+1}\neq\emptyset$, so you can take an $x_{n(k+1)}\in B_{n(k)+1}$, showing there exists an $x_{n(i)}\in B_{n(i)}$ for all $i\in\mathbb{N}$. 
How do they get that? Don't you only have that $x_{n(k+1)}\in B_{n(k)+1}$, not $B_{n(k+1)}$?
 A: You’re quite right. The proof given in that PDF is defective. Notice that the statement of the induction hypothesis doesn’t even match the first step: he starts with $x_{n(1)}\in B_1$, not $x_{n(1)}\in B_{n(1)}$. Here’s one way to fix it.
Let $n(0)=1$. Since $y\in\operatorname{cl}(T_1)$, $B_{n(0)}\cap T_1 \ne\varnothing$, and there is some $n(1) \ge 1$ such that $x_{n(1)}\in B_{n(0)}$. Suppose that $k \ge 1$ and we have already found $n(0)<n(1)<\dots < n(k)$ such that $x_{n(i)} \in B_{n(i-1)}$ for $1 \le i \le k$. Since $y \in \operatorname{cl}T_{n(k)+1}$, $B_{n(k)} \cap T_{n(k)+1} \ne \varnothing$, and there is an $n(k+1) \ge n(k)+1$ such that $x_{n(k+1)} \in B_{n(k)}$. This completes the induction step of the construction, and we now have a sequence $1 = n(0)<n(1)<n(2)<n(3)<\dots$ such that $x_{n(k)}\in B_{n(k-1)}$ for each $k \ge 1$. Note that by an easy induction $n(k)\ge k$ for each $k$.
Now if $V$ is any nbhd of $y$, there is some positive integer $j$ such that $B_j \subseteq V$, and if $k>j$, then $k-1 \ge j$, and hence $x_{n(k)}\in B_{n(k-1)} \subseteq B_j$.
Added: By the way, this argument isn’t the one that I’d actually use if I were presenting the proof myself; it strikes me as unnecessarily complicated. I’d probably use something similar to the one that LostInMath suggests. But I did want to give you something as close as possible to the faulty proof, since it can be fixed up.
A: Your question is a very good one. Indeed, we only have that $x_{n(k+1)}\in B_{n(k)+1}$ and that is not enough to keep the inductive construction going.
I think that what we want is to construct a strictly increasing sequence $n(k)$ of positive integers such that $x_{n(k)}\in B_k$ for each $k\in\{1,2,\ldots\}$. Then the same argument goes through. Also in the following paragraph, you have to make the correction: "Hence, for $k\in\mathbb{N}$: $k\geq j\Rightarrow x_{n(k)}\in B_k\subset B_j\subset V$."
