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

Proof of `Finite meets in a set-algebra` (2nd statement)

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

Collapse a constant-labelled family onto its atom, then increase each label to the corresponding family element. Transitivity gives the greatest-lower-bound property, also for an empty family.