Definition of injective for If f : X → Y :
For all y \in Y, there exists at most one x \in X such that f(x) = y
Because f : X → Y and g, h : W → X,
f ∘ g : W → X → Y and f ∘ h : W → X → Y
so f ∘ g, f ∘ h : W → Y
that's where I get stuck.
Thanks, mark- i left that out.
A subset A of a group (G,*) is called a subgroup if the elements of A form a group under *.
* is the binary operation of the two groups.