Reason: Consider the copower N:=∐n∈N1 with inclusions in:1→N for n∈N. We define z:=i1:1→N and s:N→N by s∘in=in+1. Since the category is countably distributive, we have A×N≅∐n∈NA for every object A. Given morphisms f:A→X, g:X→X, a morphism Φ:A×N→X therefore corresponds to a family of morphisms ϕn:A→X for n∈N. The condition Φ(a,z)=f(a) becomes ϕ0=f. The condition Φ(a,s(n))=g(Φ(a,n)) becomes ϕn+1=g∘ϕn. This recursively defines the morphisms ϕn. (We are basically using that N is a natural numbers object in Set.) Concretely, ϕn=gn∘f.