TD implies CCR

Assuming $\mathrm{Z}\mathrm{F}$, we prove that Turing determinacy ($\mathrm{T}\mathrm{D}$) implies countable choice axiom for sets of reals ($\mathrm{C}\mathrm{C}\mathrm{R}$).