AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.merge_time

theoremverifiedformalizationimported Lean

Cslib.Algorithms.Lean.TimeM.merge_time

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
@[simp] theorem Cslib.Algorithms.Lean.TimeM.merge_time (xs ys : List α) : (merge xs ys).time ≤ xs.length + ys.length
Formalizes
CSLib, `Cslib.Algorithms.Lean.TimeM.merge_time`
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 26
Used by 2

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@[simp] theorem Cslib.Algorithms.Lean.TimeM.merge_time (xs ys : List α) : (merge xs ys).time ≤ xs.length + ys.length := by  fun_induction merge with  | case3 =>    grind  | _ => simp
See it in the graphDiscuss this resultChallenge it