ThreeSATToClique.literalsConflict_symm
theoremverifiedimported Lean
Symmetry of literal conflict. Call two literals over a variable set *conflicting* when one is the positive and the other the negative occurrence of one and the same variable. For any two literals $l_1$ and $l_2$, $l_1$ and $l_2$ conflict if and only if $l_2$ and $l_1$ conflict; that is, the conflict relation is symmetric.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in theorem ThreeSATToClique.literalsConflict_symm {V : Type} (l1 l2 : Literal V) : literalsConflict l1 l2 ↔ literalsConflict l2 l1
- Source
- TCSlib, `ThreeSATToClique.literalsConflict_symm`
- 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.literalsConflict_symm← ThreeSATToClique.literalsConflict_symm (TCSlib/Complexity/NPReductions/ThreeSATToClique.lean:146): verbatim
- Verified
- 07 Oct 2026
- Axioms
propext- Built on 2
- ThreeSATToClique.LiteralA literal for switching-lemma formulas: a variable $\mathtt{var} : \mathrm{Fin}\,n$ with a negation flag $\mathtt{neg} : \mathrm{Bool}$…
- 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.\…
- Used by 2
- ThreeSATToClique.no_conflict_of_trueTrue 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$,…
- ThreeSATToClique.toCliqueGraphThe conflict graph of a 3-CNF formula $f$ is the simple graph on vertex set $\mathtt{CliqueVertex}\,f.\mathtt{length}$ in which two…
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/-- `literalsConflict` is symmetric. -/theorem ThreeSATToClique.literalsConflict_symm {V : Type} (l1 l2 : Literal V) : literalsConflict l1 l2 ↔ literalsConflict l2 l1 := by cases l1 <;> cases l2 <;> simp only [literalsConflict] · exact eq_comm · exact eq_comm