For a function f to be bijective, we need to check 2 conditions ~
- It must be one-one
- It must be onto
Also, a function is invertible iff it is one-one.
So yes, a bijective function is invertible and bijective as well
Consider this screenshot from Rosen
You can also try an example and confirm.