Proof of `Extremal unary data for finite presentations` (1st statement)
groundedproofs/Lax369799Proofs/FiniteExtremal.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
First increase the unary labels using evaluation monotonicity. Then remove boundary marks and loops using the reverse morphism comparison.