Proof of `Extremal unary data for finite presentations` (7th 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
Finite unary values, a Boolean root mark, and a finite set of loop directions give a finite preorder. Choose a minimal accepting datum below the supplied accepting datum.