`BookProof.ChapterEulerCountableChain.condCos_mem` (θ : ℕ → ℝ) (n : ℕ) : 0 ≤ condCos θ n ∧ condCos θ n ≤ 1

Proved

BookProof.ChapterEulerCountableChain.condCos_mem

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

theoremstimepiece

Prove the following Lean 4 theorem from ChapterEulerCountableChain.

BookProof.ChapterEulerCountableChain.condCos_mem (θ : ℕ → ℝ) (n : ℕ) : 0 ≤ condCos θ n ∧ condCos θ n ≤ 1

Formalization note: Lean 4 identifier BookProof.ChapterEulerCountableChain.condCos_mem.

Preamble

-- Generated from ChapterEulerCountableChain.lean — theorem BookProof.ChapterEulerCountableChain.condCos_mem
import Mathlib
import Definitions.Def_ChapterEulerCountableChain
open BookProof.ChapterEulerCountableChain


open scoped BigOperators
open Filter Topology

Formal statement

theorem BookProof.ChapterEulerCountableChain.condCos_mem (θ : ℕ → ℝ) (n : ℕ) : 0 ≤ condCos θ n ∧ condCos θ n ≤ 1 := by sorry

View graph