Proof of `Ordered syntactic algebras of finite presentations` (4th statement)
groundedproofs/Lax369799Proofs/FiniteOrderedAlgebra.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
A nonempty accepting filter in a finite sort has a minimal member. Closure under meet makes that member least, and upward closure gives the principal-filter characterization.