If you write a linear system in matrix form $Ax=b$, solvability means $b$ is a linear combination of the columns of $A$.
Elementary row operations never change the linear relations between the columns; more precisely, if $B$ is a matrix with columns $b_1,\dots,b_n,b_{n+1}$, $C$ is a matrix with columns $c_1,\dots,c_n,c_{n+1}$, and $C$ is obtained from $B$ by applying an elementary row operation, then
$$
\sum_{i=1}^{n+1}\alpha_ib_i=0
\quad\text{if and only if}\quad
\sum_{i=1}^{n+1}\alpha_ic_i=0
\tag{*}
$$
In particular,
$$
b_{n+1}=\sum_{i=1}^{n}\alpha_ib_i
\quad\text{if and only if}\quad
c_{n+1}=\sum_{i=1}^{n}\alpha_ic_i
\tag{**}
$$
This is because there exists an invertible matrix $E$ such that $C=EB$, so that $c_i=Eb_i$.
One elementary row operation or several doesn't change the situation.
If, in a row reduced form of the augmented matrix $[A\mid b]$ (the augmented matrix), the last column is a pivot column, then the last column is not a linear combination of other columns, so neither $b$ is a linear combination of the columns of $A$, because of (**). Hence the linear system $Ax=b$ has no solution.
Also the converse is true: if in a row reduced form of $[A\mid b]$ the last column is not a pivot column, then it is a linear combination of the previous columns and therefore also $b$ is a linear combination of the columns of $A$.