We are given a lattice $\Lambda$ in $\mathbb{R}^2$, and we are given that it contains a basis of 2 vectors, such that the integer combinations span the whole space.
Now we choose some $u$ in $\Lambda$, such that $|u|$ is minimal. We want to show that we can find a basis for $\Lambda$ for which it contains $u$.
We are also given that if the parallelogram generated by 2 elements of the lattice contains no other points of the lattice, then these 2 elements form a basis for the lattice.
Therefore we can take $v \in \Lambda$ linearly independent with $u$, such that $|v|$ is minimal. This works, and we can show it by looking at the parallelogram generated by $u$ and $v$, and seeing that if a point where inside that parallelogram, it must form a distance strictly less than $|u|$, which was minimal by assumption.
My question is this: It seems really obvious that we can extend $u$ to a basis containing $u$, and I feel like I am using many steps to prove something obvious. Is there a much easier way of doing this?