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

Proof of `Ordered syntactic algebras of finite presentations` (5th 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

Choose finite presentation representatives and apply the contextual meet characterization, using commutation of evaluation with the quotient map.