Proof of `Finite sums are contextual meets` (1st statement)
groundedproofs/Lax369799Proofs/FiniteYieldMeets.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
The finite parallel substitution is monotone in every label. Repeating a single presentation gives a cover of that presentation, so a common lower bound lies below the sum. Inclusion morphisms give the converse; the empty family has a morphism into every presentation.