Let $f \: \circ \: g$ denote function composition such that $(f \circ g)(x) = f(g(x))$. Let $f: A \rightarrow B$ such that for all $g \: : \: B \rightarrow A$ and $h \: : \: B \rightarrow A$ we have $f \: \circ \: g = f \: \circ \: h \: \Rightarrow g = h$. Which of the following must be true?
- $f$ is onto (surjective)
- $f$ is one-to-one (injective)
- $f$ is both one-to-one and onto (bijective)
- the range of $f$ is finite
- the domain of $f$ is finite
https://gateoverflow.in/95289/tifr2017-a-11
i'm not able to understand why f should be one-to-one