Physlib.List.drop_eraseIdx_succ
theoremverifiedformalizationimported Lean
Physlib.List.drop_eraseIdx_succ
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {n : Nat} in lemma Physlib.List.drop_eraseIdx_succ {I : Type} : (n : ℕ) → (r : List I) → (hn : n < r.length) → r[n] :: List.drop n (List.eraseIdx r n) = List.drop n r
- Formalizes
- Physlib, `Physlib.List.drop_eraseIdx_succ`
- 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.drop_eraseIdx_succ← Physlib.List.drop_eraseIdx_succ (Physlib/Mathematics/ForMathlib/List/InsertIdx.lean:159): 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.drop_eraseIdx_succ {I : Type} : (n : ℕ) → (r : List I) → (hn : n < r.length) → r[n] :: List.drop n (List.eraseIdx r n) = List.drop n r | 0, _, _=> by simp only [List.eraseIdx_zero, List.drop_tail, zero_add, List.drop_one, List.drop_zero] rw [@List.getElem_zero] exact List.cons_head_tail _ | n+1, [], hn => by simp at hn | n+1, a::as, hn => by simp only [List.getElem_cons_succ, List.eraseIdx_cons_succ, List.drop_succ_cons] refine drop_eraseIdx_succ n as _