`BookProof.CarlemanGeneralHop.mem_obd` {N : ℕ} {p m a : Fin d →₀ ℕ} : a ∈ obd d N p m ↔ (∀ k, a k ≤ N) ∧ (∀ k, m k ≤ a k) ∧ ∃ k, N < a k + p k
ProvedBookProof.CarlemanGeneralHop.mem_obdtheoremstimepiece
Prove the following Lean 4 theorem from ChapterCarlemanGeneralHop.
BookProof.CarlemanGeneralHop.mem_obd {N : ℕ} {p m a : Fin d →₀ ℕ} : a ∈ obd d N p m ↔ (∀ k, a k ≤ N) ∧ (∀ k, m k ≤ a k) ∧ ∃ k, N < a k + p k
Formalization note: Lean 4 identifier BookProof.CarlemanGeneralHop.mem_obd.
Preamble
-- Generated from ChapterCarlemanGeneralHop.lean — theorem BookProof.CarlemanGeneralHop.mem_obd
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_obd {N : ℕ} {p m a : Fin d →₀ ℕ} :
a ∈ obd d N p m ↔ (∀ k, a k ≤ N) ∧ (∀ k, m k ≤ a k) ∧ ∃ k, N < a k + p k := by sorry