Physlib.List.mem_eraseIdx_nodup
theoremverifiedformalizationimported Lean
Physlib.List.mem_eraseIdx_nodup
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {n : Nat} in lemma Physlib.List.mem_eraseIdx_nodup {I : Type} (i : I) : (l : List I) → (n : ℕ) → (hn : n < l.length) → (h : List.Nodup l) → i ∈ l.eraseIdx n ↔ i ∈ l ∧ i ≠ l[n]
- Formalizes
- Physlib, `Physlib.List.mem_eraseIdx_nodup`
- 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.mem_eraseIdx_nodup← Physlib.List.mem_eraseIdx_nodup (Physlib/Mathematics/ForMathlib/List/InsertIdx.lean:48): verbatim
- Verified
- 09 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- quota_population_monotone_incompatible_four_states_common_houseNo apportionment solution for four states satisfies quota and avoids population paradoxes between profiles at the same house size; twelve…
- Used by 1
- FieldStatistic.ofFinset_insertFieldStatistic.ofFinset_insert
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.mem_eraseIdx_nodup {I : Type} (i : I) : (l : List I) → (n : ℕ) → (hn : n < l.length) → (h : List.Nodup l) → i ∈ l.eraseIdx n ↔ i ∈ l ∧ i ≠ l[n] | [], _, _, _ => by simp | a1 :: as, 0, _, h => by simp only [List.eraseIdx_zero, List.tail_cons, List.mem_cons, List.getElem_cons_zero, ne_eq] by_cases hi : i = a1 · subst hi simp only [List.nodup_cons] at h simp [h] · simp [hi] | a1 :: as, n+1, hn, h => by simp only [List.eraseIdx_cons_succ, List.mem_cons, List.getElem_cons_succ, ne_eq] simp only [List.nodup_cons] at h rw [mem_eraseIdx_nodup i as n (Nat.succ_lt_succ_iff.mp hn) h.2] simp_all only [ne_eq] obtain ⟨left, right⟩ := h apply Iff.intro · intro a cases a with | inl h => subst h simp_all only [or_false, true_and] apply Aesop.BuiltinRules.not_intro intro a simp_all only [List.getElem_mem, not_true_eq_false] | inr h_1 => simp_all only [or_true, not_false_eq_true, and_self] · intro a simp_all only [not_false_eq_true, and_true]