Let A be a finite set. If `f: AvecA` is an onto function, show that `f` is one-one also.

Let A be a finite set. If f: A->A is an onto function, show that f is one-one also.

Let A be a finite set.If f:A rarr A is an onto function,show that f is one-one also.

Let A be a finite set.If f:A rarr A is an onto function,show that f is one-one also.

Let A be a finite set. If f: A->A is a one-one function, show that f is onto also.

Let A be a finite set If f: A rarr A is an onto mapping , show that it is one-one aslo .

Let A be a finite set.If f:A rarr A is a one-one function,show that f is onto also.

Let A be a finite set . If f: A rarr A is a one-one function, show that , f is a bijection.

Let f : A rarr B, g : B rarr C be two functions such that gof is one-one and onto. Show that f is one-one and g is onto.