If $x = x_1 e_1 + \cdots x_1 e_n \in \mathsf{ker}(f)$ then
$0 = f(x) = x_1f(e_1) + \cdots +x_{n-1}f(x_{n-1})+ x_nf(e_n) $
$= x_1e_2 + \cdots + x_{n-1}e_{n} + x_ne_1 $
$= x_ne_1 + x_1 e_2 + \cdots + x_{n-1}e_n$
$\Longrightarrow \quad x_n =x_1 = \cdots =x_{n-1} = 0 \quad
\Longrightarrow \quad x=0$.
Because the domain and codomain of the injective transformation $f$ have equal dimension, $f$ is an isomorphism.
Also, I really like the advice by @Adren:
A function $f:A \to B$ between two sets is injective if and only if it has a left inverse with respect to composition; that is, if and only if there exists a function $g:B \to A$ such that $g \circ f = \mathrm{Id}_A$. Similarly, a function $f:A \to B$ is surjective if and only if has a right inverse, or rather there exists a function $g:B \to A$ such that $f \circ g = \mathrm{Id}_{B}$.
In your example, $A,B = V$, and the left/right inverse $g$ you should look at is $g = f \circ \stackrel{n-1}{\cdots}\circ f$, since
$g \circ f = f \circ g = f \circ \stackrel{n}{\cdots} \circ f = \mathrm{Id}_{V}$
Of course, you should show why the composite of $f$ with itself $n$ times gives you the identity map (think permutation of the basis elements).