Answer
The second incompleteness theorem follows from the first incompleteness theorem, which states that no consistent system of axioms whose theorems can be listed by an "effective procedure" (essentially, a computer program) is capable of proving all truths about the natural numbers.