AFTD Auto-Formalizing Theoretical Domains

Physlib.List.eraseIdx_sorted

theoremverifiedformalizationimported Lean

Physlib.List.eraseIdx_sorted

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {n : Nat} in
lemma Physlib.List.eraseIdx_sorted {I : Type} (le : I → I → Prop) :
    (r : List I) → (n : ℕ) →
    List.Pairwise le r → List.Pairwise le (r.eraseIdx n)
Formalizes
Physlib, `Physlib.List.eraseIdx_sorted`
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.
Verified
09 Oct 2026
Axioms
propext

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {n : Nat} inlemma Physlib.List.eraseIdx_sorted {I : Type} (le : I → I → Prop) :    (r : List I) → (n : ℕ) →    List.Pairwise le r → List.Pairwise le (r.eraseIdx n)  | [], _, _ => by simp  | a::as, 0, h => by    simp only [List.eraseIdx]    simp only [List.pairwise_cons] at h    exact h.2  | a::as, n+1, h => by    simp only [List.eraseIdx_cons_succ, List.pairwise_cons]    simp only [List.pairwise_cons] at h    refine And.intro ?_ (eraseIdx_sorted le as n h.2)    intro b hb    refine h.1 _ ?_    exact List.mem_of_mem_eraseIdx hb
See it in the graphDiscuss this resultChallenge it