`BookProof.CarlemanGeneralHop.mem_ibd` {N : ℕ} {m b : Fin d →₀ ℕ} : b ∈ ibd d N m ↔ (∀ k, b k ≤ N + 1) ∧ (∀ k, m k ≤ b k) ∧ ¬ (∀ k, b k ≤ N)
ProvedBookProof.CarlemanGeneralHop.mem_ibdtheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanGeneralHop.
BookProof.CarlemanGeneralHop.mem_ibd {N : ℕ} {m b : Fin d →₀ ℕ} : b ∈ ibd d N m ↔ (∀ k, b k ≤ N + 1) ∧ (∀ k, m k ≤ b k) ∧ ¬ (∀ k, b k ≤ N)
Formalization note: Lean 4 identifier BookProof.CarlemanGeneralHop.mem_ibd.
Preamble
-- Generated from ChapterCarlemanGeneralHop.lean — theorem BookProof.CarlemanGeneralHop.mem_ibd
import Definitions.Def_ChapterCarlemanTwoStepPromoted
import Mathlib
import Definitions.Def_ChapterCarlemanGeneralHopPromoted
import Definitions.Def_ChapterHermiteCarlemanEsaPromoted
import Definitions.Def_ChapterCarlemanGeneralHopPromoted
open BookProof.HermiteCarleman
open BookProof.CarlemanGeneralHop
open Finset
open BookProof.HermiteCarleman
open BookProof.CarlemanTwoStep
noncomputable section
variable {d : ℕ}
variable {u : (Fin d →₀ ℕ) → ℂ}Formal statement
theorem BookProof.CarlemanGeneralHop.mem_ibd {N : ℕ} {m b : Fin d →₀ ℕ} :
b ∈ ibd d N m ↔ (∀ k, b k ≤ N + 1) ∧ (∀ k, m k ≤ b k) ∧ ¬ (∀ k, b k ≤ N) := by sorry