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

Proof of `The Decision Problems as Languages` (3rd statement)

groundedproofs/Lax117284Proofs/Injectivity.lean · lax-117284

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

An instance with no day serves nobody, and the word is the code of one such instance with the fairness parameter 11, whichever instance and parameter a word of the language is the code of.