Let be a "given" matrix and suppose . Then, for an we have
\begin{proof}
Let . Suppose . To prove this biconditional theorem, we need to show:
If , then .
If , then .
To start, recall our algorithm for creating . By construction of 17.3 Reduced Row Echelon Form matrix , there exists a sequence of elementary matrices such that
is nonsingular. This follows from the fact that any product of nonsingular matrices is also nonsingular.
Let's prove condition 1 of this proof, the forward direction.
The final line follows since for for any . Now, let's prove condition 2, the backwards direction.
The final line results from the fact that if is nonsingular, then we know iff . In this case, we set . With this, we have finished our proof in both directions, both of which hold true.