Lemma: Let $\{x_1, \ldots, x_n \}$ be a linearly independent set of vectors in a normed space $X$ (of any dimension). Then there is a number $c > 0$ such that for every choice of scalars $\alpha_1, \ldots, \alpha_n$, we have $$\Vert \alpha_1 x_1 + \ldots + \alpha_n x_n \Vert \geq c (\lvert\alpha_1\rvert + \ldots + \lvert\alpha_n\rvert).$$
I have understood the proof until the second page where the author writes each sequence $(\beta_j^{(m)})$ is bounded. I don't understand next exactly how $(y_{n, m})$ is a subsequence and how we obtain the subsequence $(y_{n,m})=(y_{n, 1}, y_{n, 2}, \cdots)$ of $(y_m)$

