Proof of `Functional restrictions of selected unary graphs` (4th statement)
groundedproofs/Lax369799Proofs/GraphChoices.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
Drill the unary vertex, apply the cyclic context-choice theorem, and identify atomic filling with the original labels.