Proof of `Normal forms retaining split-variable resolutions` (2nd statement)
groundedproofs/Lax369799Proofs/FiniteResolutionNormalForms.lean · lax-369799
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
For a rankwise-finite unfolding-invariant recognizer, bounded profiles refine contextual equivalence. The finite resolution family therefore represents the original syntactic class.