>... a subset S of the countable set F of finite words bijects with> the set D of definable numbers

Nope. Every D corresponds to some finite word. However, S,the collection of all the correspondences, may not be a subsetof F (subsets must be computable). Hence we know D issub-countable, but we do not know D is countable.