AFTD Auto-Formalizing Theoretical Domains

Nat.segment_upper_bound

theoremverifiedformalizationimported Lean

For a strictly monotonic function f : ℕ → ℕ with f 0 = 0, k < f (segment f k + 1) for all k : ℕ.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Function Set in
variable {f : ℕ → ℕ} in
theorem Nat.segment_upper_bound (hm : StrictMono f) (h0 : f 0 = 0) (k : ℕ) :
    k < f (segment f k + 1)
Formalizes
CSLib, `Nat.segment_upper_bound`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Ching-Tsun Chou. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
  • Nat.strictMono_infiniteAny strictly monotonic function f : ℕ → ℕ has an infinite range.
  • Nat.segmentThe f-segment of k, where f : ℕ → ℕ will be assumed to be at least StrictMono.
  • Nat.nth_of_strictMonoFor a strictly monotonic function f : ℕ → ℕ, f n is exactly the n-th element of the range of f.
  • Nat.segment_plus_oneA slight restatement of the definition of segment which has proven useful.
  • Nat.segment_idemFor a strictly monotonic function f : ℕ → ℕ, the segment of f k is k.
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Function Set invariable {f : ℕ → ℕ} in/-- For a strictly monotonic function `f : ℕ → ℕ` with `f 0 = 0`, `k < f (segment f k + 1)` for all `k : ℕ`. -/theorem Nat.segment_upper_bound (hm : StrictMono f) (h0 : f 0 = 0) (k : ℕ) :    k < f (segment f k + 1) := by  classical  rw [nth_of_strictMono hm (segment f k + 1), segment_plus_one h0 k]  suffices _ : k + 1 ≤ nth (· ∈ range f) (count (· ∈ range f) (k + 1)) by omega  apply le_nth_count  exact strictMono_infinite hm
See it in the graphDiscuss this resultChallenge it