It's injective if it is a one-to-one function.Define by . Show that f is injective, and find it's inverse

I need to show that , if

Comparing the two sides gives and

Hence f is injective. I think this proof is right.

The problem arises when I try and find the inverse:

and:

I don't think this accomplishes anything but this clearly isn't the right method.