Lax Lean Archive

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

Proof of `Scheduling problems as parameterized problems on words` (2nd statement)

groundedproofs/Lax434175Proofs/WordProblems.lean · lax-434175

What this proof establishes

thm✓Lax434175.WordProblems (2nd statement)

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

The identity on words, computed by the program that copies its input.