ThreeSATToClique.formula3Satisfied
defimported Lean
A 3-CNF formula $f$ is satisfied by $\alpha$ if every 3-clause $c \in f$ is satisfied by $\alpha$.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in def ThreeSATToClique.formula3Satisfied {V : Type} (α : Assignment V) (f : Formula3 V) : Prop
- Defined in
- TCSlib, `ThreeSATToClique.formula3Satisfied`
- 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.formula3Satisfied← ThreeSATToClique.formula3Satisfied (TCSlib/Complexity/NPReductions/ThreeSATToClique.lean:108): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Built on 4
- ThreeSATToClique.clause3SatisfiedA 3-clause $c$ is satisfied by $\alpha$ if at least one of its three literals $c.l_1$, $c.l_2$, $c.l_3$ evaluates to true under $\alpha$.
- ThreeSATToClique.Formula3A 3-CNF formula over $V$ is a list of 3-clauses, representing their conjunction.
- ThreeSATToClique.AssignmentA truth valuation maps each variable to a proposition.
- ThreeSATToClique.Clause3A 3-clause over $V$ is a structure with exactly three literals $l_1, l_2, l_3 : \mathtt{Literal}\,V$, representing a disjunction of…
- Used by 3
- ThreeSATToClique.ThreeSAT_to_Clique_soundnessSoundness of the 3-SAT to clique reduction. Let $f$ be a 3-CNF formula consisting of $m$ clauses. If the conflict graph of $f$ has an…
- ThreeSATToClique.is3SatisfiableA 3-CNF formula $f$ is satisfiable if there exists an assignment $\alpha$ such that $\alpha$ satisfies $f$.
- 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
set_option relaxedAutoImplicit false in set_option autoImplicit false in /-- A 3-CNF formula is satisfied if every 3-clause is satisfied. -/ def ThreeSATToClique.formula3Satisfied {V : Type} (α : Assignment V) (f : Formula3 V) : Prop := ∀ c ∈ f, clause3Satisfied α c