Proof of `The Satisfiability Criterion for 2-CNF Formulas`
groundedproofs/Lax117284Proofs/TwoSAT/Bridge.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
The formula is read as occurrence functions, under which satisfiability is , edges are and contradictory variables are ; the criterion is then , with the direction from a satisfying assignment holding for every variable by . A formula with an empty clause is unsatisfiable outright.