Lax Lean Archive

Proof of `From merge sequences to locally definable construction sequences`

groundedproofs/Lax185574Proofs/MergeToConstruction.lean · lax-185574

What this proof establishes

no assumptions

lem✓Lax185574.MergeToConstruction

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

In the paper

  • page 37 of this submission's paper

Description

The statement for graphs and Algorithm.ComputesAlgorithm.Computes, from the version for simple graphs: the algorithm is the program with its exponent, the script of a graph is that of its simple graph, and the constants stay the same.