While this submission is a draft, it cannot be used by other submissions.

Proof of `Ordered syntactic algebras of finite presentations` (4th statement)

groundedproofs/Lax369799Proofs/FiniteOrderedAlgebra.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

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.