Proof of `Order and yield properties of set-algebras` (3rd statement)
groundedproofs/Lax369799Proofs/SetAlgebraTheorems.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 associative, commutative, idempotent operation defines its usual semilattice order.