Proof of `The reduction from satisfiability to (3,4)-satisfiability` (1st statement)
What this proof establishes
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
The encoding is injective and a decoded word is the encoding of what it decodes to, so the statement is that of the reduction on formulas; a word that encodes nothing is sent to the image of an unsatisfiable formula.