I've got this review problem:
When I draw it out on paper, it seems quite intuitive: if g is not onto, then there is a "connection" that can't be made between X and some member of Z. But I'm having trouble thinking of how to formally express that...Let f: X -> Y and g: Y -> Z be functions such that gf: X -> Z is onto. Prove that g must be onto.