While this submission is a draft, it cannot be used by other submissions.

Proof of `Normal forms retaining split-variable resolutions` (2nd statement)

groundedproofs/Lax369799Proofs/FiniteResolutionNormalForms.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

For a rankwise-finite unfolding-invariant recognizer, bounded profiles refine contextual equivalence. The finite resolution family therefore represents the original syntactic class.