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

Proof of `Splitting outgoing choices in cyclic unary contexts` (3rd statement)

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

Read the Lean proof on GitHub

Description

Normal decomposition turns target union into meet of boundary and piece data. The principal extremal acceptance test preserves that meet.