Absoluteness Of Consistency

Note that any arithmetic operation is an Absolute Operation.
Take from Gödel’s Incompleteness Theorems.
Note that is an arithmetic function.
Thus is absolute for Transitive Models.
Let
and define

Also let

Proposition

for all

Proof

If there is a model of , then there is certainly no proof of
Thus:

Let be a Transitive Model of .
is absolute so

i.e.

But then we have proved

(because it has a model, namely )
We continue by induction.