Let . Then . Therefore and . Thus is surjective.

And yes, if a function is bijective then it is invertible.

EDIT: To fully illustrate this last point let be bijective function. Define . Then clearly

and , where is the identity mapping on . Note that we needed bijectivity so that was well defined.