What can be said about the relationship between row equivalent and invertible matrices? If $rref(A)$ = $I$ and $rref(B)$ = $I$, can we say that $A$ and $B$ are row equivalent?
My intuition says Yes, but I can't really prove it. If this is true, does that mean that all invertible matrices of the same dimensions are row equivalent? 
(Assume that $A$, $B$ and $I$ are $n$ by $n$)
I couldn't find an answer to this, maybe it's there somewhere, but in that case I couldn't understand it.
Thanks.

Yes -- if you can show that the inverse of elementary row operations are also elementary row operations, the proof is essentially already done (just apply the inverse of matrix B's operations to both sides).
And yes, this fact (plus a proof that an invertible matrix's row-reduced echelon form is always the identity matrix) does imply that all invertible matrices of the same dimension are row-equivalent.
