ThreeSATToClique.no_conflict_of_true
theoremverifiedimported Lean
True literals never conflict. Let $\alpha$ be a truth assignment on a set $V$ of variables, and let $\ell_1,\ell_2$ be literals over $V$, each of the form $\mathrm{pos}\,v$ (the variable $v$) or $\mathrm{neg}\,v$ (its negation). If both $\ell_1$ and $\ell_2$ evaluate to true under $\alpha$, then they do not conflict; that is, they are not the positive and negative occurrences of one and the same variable.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in lemma ThreeSATToClique.no_conflict_of_true {V : Type} (α : Assignment V) (l1 l2 : Literal V) (h1 : evalLiteral α l1) (h2 : evalLiteral α l2) : ¬ literalsConflict l1 l2
- Source
- TCSlib, `ThreeSATToClique.no_conflict_of_true`
- Lean proof
- By Yangshuo Zou, from github.com/Shilun-Allan-Li/tcslib at
c8a02591b1e5(Copyright (c) 2026 Yangshuo Zou. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.ThreeSATToClique.no_conflict_of_true← ThreeSATToClique.no_conflict_of_true (TCSlib/Complexity/NPReductions/ThreeSATToClique.lean:176): verbatim
- Verified
- 07 Oct 2026
- Axioms
propext- Built on 5
- ThreeSATToClique.LiteralA literal for switching-lemma formulas: a variable $\mathtt{var} : \mathrm{Fin}\,n$ with a negation flag $\mathtt{neg} : \mathrm{Bool}$…
- ThreeSATToClique.evalLiteralGiven a truth assignment $\alpha : V \to \mathrm{Prop}$, the evaluation of a literal $\ell$ under $\alpha$ is $\alpha(v)$ when…
- ThreeSATToClique.AssignmentA truth valuation maps each variable to a proposition.
- ThreeSATToClique.literalsConflictTwo literals $l_1$ and $l_2$ conflict if one is the positive and the other the negative occurrence of the same variable, i.e.\…
- ThreeSATToClique.literalsConflict_symmSymmetry of literal conflict. Call two literals over a variable set *conflicting* when one is the positive and the other the negative…
- Used by 1
- ThreeSATToClique.ThreeSAT_to_Clique_completenessCompleteness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses, and let its conflict graph be the…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit false inset_option autoImplicit false in/-- Two simultaneously true literals cannot conflict: if `α` makes both `l1` and `l2` true, they cannot be complementary. *Proof*: complementarity forces `α v` and `¬ α v` for the same `v`. -/lemma ThreeSATToClique.no_conflict_of_true {V : Type} (α : Assignment V) (l1 l2 : Literal V) (h1 : evalLiteral α l1) (h2 : evalLiteral α l2) : ¬ literalsConflict l1 l2 := by intro hc cases l1 <;> cases l2 <;> simp only [literalsConflict, evalLiteral] at hc h1 h2 · -- l1 = .pos v1, l2 = .neg v2, conflict forces v1 = v2. rw [hc] at h1; exact h2 h1 · -- l1 = .neg v1, l2 = .pos v2, conflict forces v1 = v2. rw [hc] at h1; exact h1 h2