My question stems from this post - Informal proof of Gödel's second incompleteness theorem
Basically the proof of second incompleteness theorem goes like this:
Say G is the Godel statement of T. Cons(T) => G
So if we manage to prove Cons(T) within T, then we have a contradiction and hence it is inconsistent.
But then we also know that if a system is inconsistent then every statement is provable. Basically,
$\neg Cons(T) => G$
So if Cons(T) => G and $\neg Cons(T) => G$
then G should be true independent of whether Cons(T) is true. Why cannot we formalize that argument within T to prove that G is true without asserting Cons(T)? What am I missing?