Prove2Me

`BookProof.ChapterF6.mg_lower` (k : ℕ) (s : List α) (y : α) : s.count y ≤ (mg k s) y + mgD k 0 s

Proved
BookProof.ChapterF6.mg_lower

by leonardopedro · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

theoremstimepiece

Prove the following Lean 4 theorem from ChapterF6.

BookProof.ChapterF6.mg_lower (k : ℕ) (s : List α) (y : α) : s.count y ≤ (mg k s) y + mgD k 0 s

Formalization note: Lean 4 identifier BookProof.ChapterF6.mg_lower.

Preamble
-- Generated from ChapterF6.lean — theorem BookProof.ChapterF6.mg_lower
import Mathlib
import Definitions.Def_ChapterF6
open BookProof.ChapterF6


open scoped BigOperators


variable {α : Type*} [DecidableEq α]
Formal statement
theorem BookProof.ChapterF6.mg_lower (k : ℕ) (s : List α) (y : α) :
    s.count y ≤ (mg k s) y + mgD k 0 s := by sorry

View graph