Bijective Functions

Consider a function f from A to B such that f : A → B is bijective.
f–1 represents inverse of f.
Than could we say that f-1 :B->A is also bijective..Please give proper reasoning thanks

shivani @shivani1234
7 Oct 2017 11:46 am

A function is bijective when it is both one-one and onto , that means for a particular value in domain there will be a unique value in codomain and here codomain is equal to range , that means all values in co-domain have got been mapped . 
Inverse of bijective function is bijective as you can see from following example: