Proof of `Splitting outgoing choices in cyclic unary contexts` (2nd 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
Iterate binary splitting over a nonempty finite set of target vertices.