Distinct closure claims are jointly inconsistent
ProvedTranscendenceTower.Reification.closure_collideIf then has no model.
Two completeness claims about the same level, each honestly made, cannot both be held merely because each was made in good faith. Here is the semantic condition that the extension of is exactly , so the collision is immediate: no model gives two different extensions, and plays no part in the argument. Read as axiom schemas, the same collision is syntactic: choosing a code in , the first closure claim yields and the second yields .
This distinguishes closure claims sharply from ordinary assertions. Two ordinary claims about different subjects coexist without difficulty, whereas two closure claims about the same level are in direct contradiction whenever their extents differ at all. The practical consequence is that an unrelativized completeness claim is incompatible with any other completeness claim of different extent, including one made later by the same agent about the same level after the level has changed.
Limits. The formal content is elementary: under this encoding the theorem amounts to the fact that a set cannot equal two different sets. Its interest lies in the reading above, not in the difficulty of the proof.
import Definitions.Def_TranscendenceTowerReification set_option autoImplicit false
namespace TranscendenceTower.Reification
theorem closure_collide : ∀ (S S' : Set L0), S ≠ S' →
¬ ∃ M : RStruc, SatT0 M ∧ SatCL M S ∧ SatCL M S' := by sorry
end TranscendenceTower.Reification