Let [imath]f:A \to B[/imath] and [imath]g:B\to C[/imath] be two functions, show that if [imath]g\circ f[/imath] is injective then [imath]f[/imath] injective.
My try: suppose that the theorem is false, that is suppose it is true that [imath]g\circ f[/imath] injective and[imath]f[/imath] not injective. Since is true that [imath]f[/imath] is not injective, it is true that there exist [imath]a_1,a_2 \in A[/imath] such that [imath]f(a_1)=f(a_2)[/imath] and [imath]a_1 \ne a_2[/imath].
By hypothesis it is true that [imath]g \circ f[/imath] is injective, hence it is true that [imath]g(f(a_1)) = g(f(a_2)) \implies a_1=a_2[/imath]; so it is true that I have both [imath]a_1=a_2[/imath] and [imath]a_1 \ne a_2[/imath], a contradiction. Is this correct?
My try: suppose that the theorem is false, that is suppose it is true that [imath]g\circ f[/imath] injective and[imath]f[/imath] not injective. Since is true that [imath]f[/imath] is not injective, it is true that there exist [imath]a_1,a_2 \in A[/imath] such that [imath]f(a_1)=f(a_2)[/imath] and [imath]a_1 \ne a_2[/imath].
By hypothesis it is true that [imath]g \circ f[/imath] is injective, hence it is true that [imath]g(f(a_1)) = g(f(a_2)) \implies a_1=a_2[/imath]; so it is true that I have both [imath]a_1=a_2[/imath] and [imath]a_1 \ne a_2[/imath], a contradiction. Is this correct?