Proof of `Construction 2` (5th statement)
groundedproofs/Lax470956Proofs/Reduce.lean · lax-470956
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
On a well-formed formula the map is Construction 2 and the claim is the correctness of the construction, transported along the encoding; on any other word both sides are false, the left because satisfiability asks for well-formedness and the right because the instance the word is sent to has a job and no machine to run it on.