The set of all statements is easily seen to be countable, so the subset of statements being true, being infinite, is countable as well.

It does not make any difference, though, since what matters here is, as I said, recursive enumerability of axioms. Anyway, transfinite induction lets one use "pick next element" arguments even on uncountable sets.