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.
Description
Normal decomposition turns target union into meet of boundary and piece data. The principal extremal acceptance test preserves that meet.