AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.mergeSort_perm

theoremverifiedformalizationimported Lean

Cslib.Algorithms.Lean.TimeM.mergeSort_perm

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 List in
theorem Cslib.Algorithms.Lean.TimeM.mergeSort_perm (xs : List α) : ⟪mergeSort xs⟫ ~ xs
Formalizes
CSLib, `Cslib.Algorithms.Lean.TimeM.mergeSort_perm`
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 28
Used by 1

Lean source view module on GitHub

set_option quotPrecheck falseopen Cslib Cslib.Algorithms Cslib.Algorithms.Lean Cslib.Algorithms.Lean.TimeMlocal macro "✓[" c:term "]" body:doElem : doElem => `(doElem| do TimeM.tick $c; $body:doElem)local macro "✓" body:doElem : doElem => `(doElem| ✓[1] $body)local notation:max "⟪" tm "⟫" => (TimeM.ret tm)set_option relaxedAutoImplicit true inopen Cslib Cslib.Algorithms Cslib.Algorithms.Lean Cslib.Algorithms.Lean.TimeM inset_option autoImplicit false invariable {α : Type} [LinearOrder α] inopen List intheorem Cslib.Algorithms.Lean.TimeM.mergeSort_perm (xs : List α) : ⟪mergeSort xs⟫ ~ xs := by  fun_induction mergeSort xs with  | case1 => simp  | case2 x _ _ left right ih2 ih1 =>    simp only [ret_bind]    calc      ⟪merge ⟪mergeSort left⟫ ⟪mergeSort right⟫⟫  ~      ⟪mergeSort left⟫ ++ ⟪mergeSort right⟫  := by apply merge_perm      _ ~ left++right := Perm.append ih2 ih1      _ ~ x := by simp only [take_append_drop, Perm.refl, left, right]
See it in the graphDiscuss this resultChallenge it