Proof of `Morphisms of unpruned finite presentations` (6th statement)
groundedproofs/Lax369799Proofs/FiniteCovers.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
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.