`BookProof.ChapterEulerNState.tailSum_nonneg` (p : ℕ → ℝ) (hp : ∀ k, 0 ≤ p k) (n k : ℕ) : 0 ≤ tailSum p n k
ProvedBookProof.ChapterEulerNState.tailSum_nonnegtheoremstimepiece
Prove the following Lean 4 theorem from ChapterEulerNState.
BookProof.ChapterEulerNState.tailSum_nonneg (p : ℕ → ℝ) (hp : ∀ k, 0 ≤ p k) (n k : ℕ) : 0 ≤ tailSum p n k
Formalization note: Lean 4 identifier BookProof.ChapterEulerNState.tailSum_nonneg.
Preamble
-- Generated from ChapterEulerNState.lean — theorem BookProof.ChapterEulerNState.tailSum_nonneg import Mathlib import Definitions.Def_ChapterEulerNState open BookProof.ChapterEulerNState open scoped BigOperators
Formal statement
theorem BookProof.ChapterEulerNState.tailSum_nonneg (p : ℕ → ℝ) (hp : ∀ k, 0 ≤ p k) (n k : ℕ) :
0 ≤ tailSum p n k := by sorry