Proof of `Ordered syntactic algebras of finite presentations` (5th 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
Choose finite presentation representatives and apply the contextual meet characterization, using commutation of evaluation with the quotient map.