`BookProof.ChapterF6.mg_upper` (k : ℕ) (s : List α) (y : α) : (mg k s) y ≤ s.count y

Proved

BookProof.ChapterF6.mg_upper

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterF6.

BookProof.ChapterF6.mg_upper (k : ℕ) (s : List α) (y : α) : (mg k s) y ≤ s.count y

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

Preamble

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


open scoped BigOperators


variable {α : Type*} [DecidableEq α]

Formal statement

theorem BookProof.ChapterF6.mg_upper (k : ℕ) (s : List α) (y : α) : (mg k s) y ≤ s.count y := by sorry

View graph