Do I need axiom of choice in this proof here?
I think not: at each step we choose one element from a set $N - \langle g_1, \dots, g_k \rangle $. So while there is indeed a countable number of sets involved from which we choose elements, I could also think of the process as follows:
Assume $N$ is generated uncountably. Let $C = \{g_1 , g_2, \dots \}$ be a countable subset of the generators of $N$. (So far we have not used choice, right?) We may write $C$ as a countable union of singleton sets $\bigcup_n \{g_n\}$. But now we can write down an explicit choice function: Let $c(\{x\}) = x$. Since the union is countable, we may consider the choice function $\tilde{c}: \mathbb N \to C, n \mapsto g_n$.
From here, we can finish the argument as follows: Then the following is an increasing chain of submodules: $\langle \tilde{c}(1) \rangle \subset \langle \tilde{c}(1), \tilde{c}(2) \rangle \subset \dots$, avoiding the axiom of choice.
Would someone tell me where my argument is flawed? Thanks.