My proof is basically the same as yours, but perhaps this will be a bit more intuitive.
We want to find the volume of a $k$-parallelepiped spanned by $v_1,v_2,...,v_k$ in $\mathbb{R}^k$. We are armed only with the determinant, which lets us find the (signed) volume of $m$-parallelepipeds in $\mathbb{R}^m$.
The crucial observation is that, for any good definition of volumes, we should have that the "$m$ -volume" of $v_1,v_2,...,v_m \in \mathbb{R}^n$ should be the same as the "$m+1$-volume" of $v_1,v_2,...,v_m,w \in \mathbb{R}^n$ if $w$ is perpendicular to all the $v_j$, and is of length $1$. In other words "Volume equals base times height".
So the volume of $v_1,v_2,...,v_k \in \mathbb{R}^n$ is the same as the volume of $v_1,v_2,...,v_k,w_1,w_2,...,w_{n-k}$, where each $w_i$ is orthogonal to all the other vectors in the list, and is of norm $1$.
So we could just say that the volume is $Det(v_1,v_2,...,v_k,w_1,w_2,...,w_{n-k})$. This is a recipe for how to find the volume, but it suffers some flaws as a definition and as a computational tool of $k$-volumes. As a definition, it is difficult because we would need show that the result is independent of the choice of $w_i$, and because the sign is meaningless (it depends on the $w_k$). As a computational tool, one actually needs to carry out the laborious process of calculating $w_i$ which work. It seems we should be able to find a formula which does not involve actually calculating these auxiliary vectors.
The insight is to realize that the determinant of the transpose is the same as the determinant of the original matrix. So letting $M = (v_1 v_2 ... v_k w_1 ... w_{n-k})$ and $A = (v_1 v_2 ... v_k)$
$\textrm{Vol}^2 = Det(M^\top M)$
But when we actually compute the matrix $M^\top M$, we see that it consists of $A^\top A$ and then ones down rest of the diagonal. So its determinant is just $Det(A^\top A)$.
Thus $\textrm{Vol}^2 = Det(A^\top A)$.