Lax Lean Archive

Proof of `The Reduction from (3,4)-Satisfiability to [2,3]-Bounded 3-SAT` (2nd statement)

groundedproofs/Lax345332Proofs/BSat.lean · lax-345332

What this proof establishes

no assumptions

def✓Lax345332.Copies (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

In the paper

  • page 5 of this submission's paper

Description

Forwards, every copy takes the value of its variable; backwards, the cycle clauses force the copies of a variable to agree, and the common value satisfies the original clause.