Proof of `Bounded profiles refine finite contextual equivalence` (2nd statement)
groundedproofs/Lax369799Proofs/BoundedProfileRefinement.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
Regularize an arbitrary recognizing algebra without changing its language or rankwise finiteness, then apply bounded-profile finiteness.