Proof of `Yield acceptance of finite presentations` (4th statement)
groundedproofs/Lax369799Proofs/FiniteAcceptance.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
Restricting an already reachable system preserves its unfolding class. Acceptance of that system is membership in the original language.