AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.mergeSort_time_le

theoremverifiedformalizationimported Lean

Cslib.Algorithms.Lean.TimeM.mergeSort_time_le

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.mergeSort_time_le (xs : List α) :
    (mergeSort xs).time ≤ timeMergeSortRec xs.length
Formalizes
CSLib, `Cslib.Algorithms.Lean.TimeM.mergeSort_time_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 29
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) intheorem Cslib.Algorithms.Lean.TimeM.mergeSort_time_le (xs : List α) :    (mergeSort xs).time ≤ timeMergeSortRec xs.length := by  fun_induction mergeSort with  | case1 =>    grind  | case2 _ _ _ _ _ ih2 ih1 =>    simp only [time_bind]    grw [merge_time]    simp only [mergeSort_same_length]    unfold timeMergeSortRec    grind
See it in the graphDiscuss this resultChallenge it