Research proof index

Closure inversion at the code level. Substituting the free-variable atoms &0 … &(m-1) back into the fixitr-image recovers ⌜φ⌝. This is the DECODE direction: the recognizer can recover ⌜succInd ψ⌝ (hence ψ) from the freevar-free closure body using the already-proven internal subst, with no need for an internal fixitr. Meta witness: `sub...

Raw closure inversion. subst (fvarVec (fvSup φ)) ⌜fixitr 0 (fvSup φ) ▹ φ⌝ = ⌜φ⌝: the internal substitution by fvarVec undoes the universal-closure fixitr at the code level. This is the recognizer's mechanism for recovering ⌜succInd ψ⌝ from the freevar-free closure body.

Generalized free-ization. For any β : _root_.LO.FirstOrder.ArithmeticSemiformula ℕ m, substituting the free-variable atoms &0 … &(m-1) for its m bound slots equals ⌜β ⇜ (&·)⌝. This is the forward recognizer's tool: once IsSemiformula.sound yields a β with ⌜β⌝ = b, this computes subst (fvarVec m) b. (Specializes to `subst_fvarVec_quot...

termBShift shifts the bound-variable depth up by exactly one (on well-formed terms): so t is a level-m term iff termBShift t is level-(m+1). The ←-direction recovers the lowered arity, which is how the bounded-∀ bound (a termBShift-image) is recognized as a bShift of a real term of the outer arity.

mem_iff math (C = Hierarchy 𝚺 1). Mirrors chUniv_mem_iff, threading the IsSigma1 K side condition through isSigma1_iff_hierarchy.

Church's theorem, for an arbitrary arithmetic theory T ⊇ 𝗥₀ sound on 𝚺₁ sentences: the set of T-provable sentences is not computable.