Once we have described f {\displaystyle f} as a function from A {\displaystyle A} to B {\displaystyle B} , by convention we will call B {\displaystyle B} the codomain, even though other sets, of which B {\displaystyle B} is a subset, could have been used. […] If y {\displaystyle y} is an element of the codomain, then y ∈ I m g ( f , A ) {\displaystyle y\in {\mathit {Img}}(f,A)} iff there is some x {\displaystyle x} in the domain such that f {\displaystyle f} maps x {\displaystyle x} to y {\displaystyle y} .
2006, Robert L. Causey, Logic, Sets, and Recursion, 2nd Edition, Jones & Bartlett Learning, page 192