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

Proof of `Functional restrictions of selected unary graphs` (1st 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

Complete a choice to use an existing edge whenever possible. The original restriction maps into its completion, so reverse morphism monotonicity supplies acceptance for the restrictions that delete all outgoing edges.