Godel's "proof" states that G is undecidable, and since that is what G states, G must be True, and this G is a True statement that cannot be proven (or disprove

Godel's "proof" states that G is undecidable, and since that is what G states, G must be True, and this G is a True statement that cannot be proven (or disproven). I say that the conclusion that G is True does not follow. Calling G True is no better than calling G False. Nobody can prove GIT (Godel's Incompleteness Theorem). I tried to disprove it, but I can't do that either. Godel's Incompleteness Theorem itself is a Godel Sentence. You can add GIT as an axiom in my system, then it would become True. I'm saying that you don't need to do that to have a complete system. You can either have a complete and consistent system, OR you can have GIT.