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.
Description
An instance with no day serves nobody, and the word is the code of one such instance with the fairness parameter , whichever instance and parameter a word of the language is the code of.