This proof is based on a result in Prasalov's problem book in linear algebra.
Let the row vector $u_i = \begin{pmatrix} u_{i1} & u_{n2} & \dots & u_{in} \end{pmatrix}$ denote the coordinates of $\vec{u_i}$ with respect to the ordered basis $B'=\{\vec{v_1},\dots,\vec{v_n}\}$ and let $U$ denote the matrix with rows $u_1,\dots,u_n.$ Clearly the row vector $e_i$ which has $1$ for its $i$th entry and $0$ for all other entries represents the vector $\vec{v_i}$ in this basis.
Expanding $\operatorname{det}(U)$ along the first row we have:
$$\operatorname{det}(U) = \sum_{j=1}^{n} (-1)^{1+j} u_{1j} M_{1j},$$ where $M_{1j}$ is the determinant of the matrix obtained by deleting the first row and the $j$th column of $U$.
Since $\operatorname{det}(U) \neq 0$, at least one term in the above sum is not $0$ so assume $u_{1k} \neq 0$ and $M_{1k} \neq 0$.
This implies $ \operatorname{det}\left( \begin{matrix} u_1\\
e_1\\
e_2\\
\dots\\
e_{k-1}\\
e_{k+1}\\
\dots
\\
e_n
\end{matrix} \right) = \operatorname{det}(A) \text{ (say)} =(-1)^{1+k} u_{1k} \neq 0$ and $\operatorname{det}\begin{pmatrix}e_k \\ u_2 \\ u_3 \\ \dots\\ u_n \end{pmatrix} = \operatorname{det}(B) \text{ (say)} = (-1)^{1+k}M_{1k} \neq 0$. The non-singularity of $A$ implies $\{\vec{u_1},\vec{v_1},\vec{v_2},\dots,\vec{v_{k-1}},\vec{v_{k+1}},\dots,\vec{v_n}\}$ forms a basis and the non-singularity of $B$ implies $\{\vec{v_k},\vec{u_2},\dots,\vec{u_n}\}$
forms a basis.