I am in discrete structures and have to solve this proof and have been having a fairly difficult time with it, probably easy but math was never my strong suit.

If f: A--->B is a bijection and g: B--->C is injective, prove that g o f is injective.

Printable View

- Sep 20th 2009, 02:04 PMDaxHelp with composition proof
I am in discrete structures and have to solve this proof and have been having a fairly difficult time with it, probably easy but math was never my strong suit.

If f: A--->B is a bijection and g: B--->C is injective, prove that g o f is injective.

- Sep 20th 2009, 02:09 PMPlato