pith. machine review for the scientific record. sign in
theorem proved term proof

sat_reaches_zero

show as:
view Lean formalization →

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

generate prose now

formal statement (Lean)

 123theorem sat_reaches_zero {n : ℕ} (f : CNFFormula n) (h : f.isSAT) :
 124    ∃ a : Assignment n, satJCost f a = 0 := by

proof body

Term-mode proof.

 125  obtain ⟨a, ha⟩ := h
 126  exact ⟨a, (satJCost_zero_iff f a).mpr ha⟩
 127
 128/-- The recognition time for a satisfiable formula is ≤ n (variable count). -/

used by (2)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (10)

Lean names referenced from this declaration's body.