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

Proof of `Nonempty powerset algebras` (1st statement)

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

Choices in flattened systems extend to the removed vertices because each allowed label set is nonempty. Associativity then follows from the original algebra's flattening law.