Lemma 1: an invertible matrix has non-zero determinant.
=> det(A) ≠ 0, since A is invertible.
Theorem: det(A) = det(AT)
Hence if det(A) ≠ 0 <=> det(AT) ≠ 0.
By Lemma 1, AT is invertible.
The general idea is that if A has non-zero determinant, then so does A^T.
---
For the second proof, it's a bit more difficult, and requires you to know a second theorem:
Theorem: An invertible matrix has a unique inverse.
Begin by stating that:
(A*A^-1) = I
(A*A^-1)^T = I^T = I
(A^-1)^T * A^T = I
This is since (AB)^T = B^T * A^T.
However, we have shown that (A^-1)^T is the inverse matrix of A^T, since they multiply to give the identity matrix, and this matrix form is unique from the Theorem.
So we can say fully, that the last line has the implication that (A^T)^-1 = (A^-1)^T.
This means the inverse of the transpose is the transpose of the inverse, and is a property of the transpose matrix.