Physlib.List.insertIdx_eq_take_drop
theoremverifiedformalizationimported Lean
Physlib.List.insertIdx_eq_take_drop
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {n : Nat} in lemma Physlib.List.insertIdx_eq_take_drop {I : Type} (i : I) : (r : List I) → (n : Fin r.length.succ) → List.insertIdx r n i = List.take n r ++ i :: r.drop n
- Formalizes
- Physlib, `Physlib.List.insertIdx_eq_take_drop`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2024 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.Physlib.List.insertIdx_eq_take_drop← Physlib.List.insertIdx_eq_take_drop (Physlib/Mathematics/ForMathlib/List/InsertIdx.lean:78): verbatim
- Verified
- 09 Oct 2026
- Axioms
propext
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {n : Nat} inlemma Physlib.List.insertIdx_eq_take_drop {I : Type} (i : I) : (r : List I) → (n : Fin r.length.succ) → List.insertIdx r n i = List.take n r ++ i :: r.drop n | [], 0 => by simp | a :: as, 0 => by simp | a :: as, ⟨n + 1, h⟩ => by simp only [List.insertIdx_succ_cons, List.take_succ_cons, List.drop_succ_cons, List.cons_append, List.cons.injEq, true_and] exact insertIdx_eq_take_drop i as ⟨n, Nat.succ_lt_succ_iff.mp h⟩