In the question is assumed that the function $f$ is a one-to-one function from $A$ onto $B$.
Here is my atempt:
By definition I have that: $f^{-1} = \{(x,y) : (y,x) \in f\}$ and from this I conclude that $(f^{-1})^{-1} = \{(x,y) : (y,x) \in f^{-1}\}$
First let some $t$ belong to $(f^{-1})^{-1}$ where $t=(a,b)$, from this we have that $(b,a) \in f^{-1}$, but if $(b,a)$ is in $f^{-1}$, then $(a,b) = t \in f$ and from this $(f^{-1})^{-1} \subseteq f.$
Now let some $t$ belong to $f$ with $t=(u,v)$, from this we have that $(v,u) \in f^{-1}$ and then $t = (u,v) \in (f^{-1})^{-1}$ and therefore $f \subseteq (f^{-1})^{-1}$ $$[((f^{-1})^{-1} \subseteq f) \land (f \subseteq (f^{-1})^{-1})] \Leftrightarrow (f^{-1})^{-1} = f$$
This question is under the exercises about composition of functions, should I have using some property of composition?