Why can countable recursive constructions not be done using countable choice? For example, replace $Z$ by $\omega$ in the following theorem
Why can't one prove it using countable choice? (The proof for the given version is the following:
As pointed out in the comments by Brian, modifying the given argument won't work. But what about a different proof? Is it clear that that's not possible?
Thanks for your help.