AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.timeMergeSortRec_le

theoremverifiedformalizationimported Lean

Solve the recurrence

Statement

set_option relaxedAutoImplicit true in
open Cslib Cslib.Algorithms Cslib.Algorithms.Lean Cslib.Algorithms.Lean.TimeM in
set_option autoImplicit false in
variable {α : Type} [LinearOrder α] in
open Nat (clog) in
theorem Cslib.Algorithms.Lean.TimeM.timeMergeSortRec_le (n : ℕ) : timeMergeSortRec n ≤ T n
Formalizes
CSLib, `Cslib.Algorithms.Lean.TimeM.timeMergeSortRec_le`
Lean proof
By Sorrachai Yingchareonthawornhcai, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Sorrachai Yingchareonthawornhcai. 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 27
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit true inopen Cslib Cslib.Algorithms Cslib.Algorithms.Lean Cslib.Algorithms.Lean.TimeM inset_option autoImplicit false invariable {α : Type} [LinearOrder α] inopen Nat (clog) in/-- Solve the recurrence -/theorem Cslib.Algorithms.Lean.TimeM.timeMergeSortRec_le (n : ℕ) : timeMergeSortRec n ≤ T n := by  fun_induction timeMergeSortRec with  | case1 => grind  | case2 => grind  | case3 n ih2 ih1 =>    grw [ih1,ih2]    have := some_algebra n    grind [Nat.add_div_right]
See it in the graphDiscuss this resultChallenge it