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

Proof of `Functional restrictions of selected unary graphs` (3rd 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.

Read the Lean proof on GitHub

Description

Induct over the finite set of vertices. At each vertex use unary extremality, or absence of outgoing edges for a nullary label.