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

Proof of `Extended set-algebras and extremal accepted situations` (4th statement)

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

Decompose the given context without planting it. Minimize the whole accepted situation, then restore its context pieces by monotonicity and upward closure of the accepting set.