AFTD Auto-Formalizing Theoretical Domains

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.
Verified
07 Oct 2026
Axioms
none listed
Built on 4
Used by 3

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