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

Proof of `Bounded profiles refine finite contextual equivalence` (2nd statement)

groundedproofs/Lax369799Proofs/BoundedProfileRefinement.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

Regularize an arbitrary recognizing algebra without changing its language or rankwise finiteness, then apply bounded-profile finiteness.