AFTD Auto-Formalizing Theoretical Domains

Nat.base_zero_strictMono

theoremverifiedformalizationimported Lean

Nat.base_zero_strictMono

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Function Set in
variable {f : ℕ → ℕ} in
theorem Nat.base_zero_strictMono (hm : StrictMono f) :
    StrictMono (f · - f 0)
Formalizes
CSLib, `Nat.base_zero_strictMono`
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
Quot.soundpropext

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Function Set invariable {f : ℕ → ℕ} intheorem Nat.base_zero_strictMono (hm : StrictMono f) :    StrictMono (f · - f 0) := by  intro m n h_m_n; simp  have := hm h_m_n  have : f 0 ≤ f m := by simp [StrictMono.le_iff_le hm]  have : f 0 ≤ f n := by simp [StrictMono.le_iff_le hm]  omega
See it in the graphDiscuss this resultChallenge it