2 Answers
2

Since $B$ is denumerable, there is a bijection $f: B \rightarrow \mathbb{N}$. Put a strict total order $\prec$ on $B$ defined by $x \prec y$ if and only if $f(x) < f(y)$ for $x,y \in B$.

Define now $\prec$ on $C$ via restriction and define a function $g: \mathbb{N} \rightarrow C$ in the natural way ($g(0)$ is the least element of $C$, $g(1)$ is the least element of $C \setminus \{g(0)\}$, and so on).

The function $g$ is injective because $\prec$ is a strict total order and is surjective because $C$ is infinite.

Elements of $B$ can be arranged in a sequence $(x_n)$. Construct a subsequence $(x_{n_k})$ inductively as follows: Let $x_{n_1}$ be the first element of $(x_n)$ which is in $C$. Assuming $x_{n_k}$ has been chosen, consider the least integer $n_{k+1}$ such that $n_{k+1}>n_k$ and that $x_{n_{k+1}}\in C$. Clearly the subsequence $(x_{n_k})$ contains all of $C$, following which $C$ is denumerable.