A limit stage of the tower is the union of the earlier stages
ProvedTranscendenceTower.Transfinite.InLang.exists_lt_of_limitLet be a limit ordinal. Every formula of the limit language already belongs to some earlier stage:
Together with the fact that the languages form a chain, this gives the set equality .
This is the load-bearing step of the transfinite construction. A valuation at a limit stage is defined as the union of the valuations at all earlier stages, and that union is well defined only because every formula it must evaluate is already present, and already assigned a value, before the limit is reached. Successor stages present no difficulty; the limit is the only place where the argument could have failed.
The proof is by induction on the generation of . The atom case uses only . The case of needs a stage strictly above , which a limit ordinal supplies by definition. The binary connectives take the maximum of the two witnesses, which remains below .
import Definitions.Def_TranscendenceTowerTransfinite set_option autoImplicit false
namespace TranscendenceTower.Transfinite
theorem InLang.exists_lt_of_limit (lam : Ordinal) (hlim : IsLimitOrd lam)
(p : TForm) (hp : InLang lam p) : ∃ β, β < lam ∧ InLang β p := by sorry
end TranscendenceTower.Transfinite