Proof of `Splitting outgoing choices in cyclic unary contexts` (1st 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
The context contains its hole, so its vertex set is nonempty. Apply finite splitting to all targets.