`BookProof.CarlemanGeneralHop.ibd_multiplicity` (m : Fin d →₀ ℕ) (b : Fin d →₀ ℕ) (M : ℕ) : (((Finset.range M).filter (fun N => b ∈ ibd d N m)).card) ≤ 1
ProvedBookProof.CarlemanGeneralHop.ibd_multiplicitytheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanGeneralHop.
BookProof.CarlemanGeneralHop.ibd_multiplicity (m : Fin d →₀ ℕ) (b : Fin d →₀ ℕ) (M : ℕ) : (((Finset.range M).filter (fun N => b ∈ ibd d N m)).card) ≤ 1
Formalization note: Lean 4 identifier BookProof.CarlemanGeneralHop.ibd_multiplicity.
Preamble
-- Generated from ChapterCarlemanGeneralHop.lean — theorem BookProof.CarlemanGeneralHop.ibd_multiplicity
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Mathlib
import Definitions.Def_ChapterCarlemanGeneralHopPromoted
import Definitions.Def_ChapterCarlemanGeneralHopPromoted
open BookProof.CarlemanGeneralHop
open Finset
open BookProof.HermiteCarleman
open BookProof.CarlemanTwoStep
noncomputable section
variable {d : ℕ}
variable {u : (Fin d →₀ ℕ) → ℂ}Formal statement
theorem BookProof.CarlemanGeneralHop.ibd_multiplicity (m : Fin d →₀ ℕ) (b : Fin d →₀ ℕ) (M : ℕ) :
(((Finset.range M).filter (fun N => b ∈ ibd d N m)).card) ≤ 1 := by sorry