AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
propext
Built on 5
Used by 1

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it