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

Proof of `Morphisms of unpruned finite presentations` (6th statement)

groundedproofs/Lax369799Proofs/FiniteCovers.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

Monotonicity of substitution gives monotonicity of the binary sum. Its idempotence and the two inclusion morphisms characterize the greatest lower bound in the contextual preorder.