Let $(E, ||\cdot||)$ be a normed vector space and $(x_\alpha)_{\alpha \in A}\subset E$ be a summable family. Then ,the set $B = \{\alpha \in A | x_\alpha \ne 0\}$ is at most countable.
I am stuck with the proof. What I've tried:
Because $(x_\alpha)_\alpha$ is summable, it is Cauchy, so for every $\epsilon > 0$ there exists $F_\epsilon \subset A$ a finite set such that for any $J \subset A$ finite such that $F_\epsilon \cap J = \emptyset$ we have $||\sum_{\alpha \in J} x_\alpha|| < \epsilon$.
Now, let's take $\epsilon = \frac{1}{n}$. Then there exists $F_n \subset A$ finite such that for any $J \subset A$ with $J \cap F_n = \emptyset$ we have $||\sum_{\alpha \in J} x_\alpha|| < \epsilon$.
We can observe that $B = \cup_{n \in \mathbb{N}}B_n$ where $B_n = \{\alpha \in A | ||x_\alpha|| > \frac{1}{n}\}$. Now suppose that $B_n$ is infinite. Then we can take $C=\{\alpha_1, \ldots, \alpha_k\} \subset B_n \setminus F_n$. So, $C \cap F_n = \emptyset$ and $C$ is finite implies $||\sum_{\alpha \in C}x_\alpha|| < \frac{1}{n}$. But $\sum_{\alpha \in C} ||x_\alpha|| > \frac{k}{n}$.
How I can get here a contradiction? (Because if I get a contradiction, then B is countable union of at most countable sets, so it is at most countable and the proof is done).