How can one prove that if a function is bijective then it has an inverse function?
Say you have a function:
$\displaystyle f: x \to y$
And you then have a function which is the inverse relation of f, then it should be enough to prove that the inverse is bijective, because since f is the inverse relation of its inverse, f will automatically be bijective.