chore: cleanup simps in CNF.Basic / DHashMap.Internal.List (#5189)

A few unused implementation detail simp lemmas had leaked out and were
being detected by the confluence checker. Just remove them or make them
local.

src/Std/Data/DHashMap/Internal/List/Associative.lean

@@ -973,7 +973,7 @@ theorem getValueD_insertEntry_self {β : Type v} [BEq α] [EquivBEq α] {l : Lis
     {k : α} {fallback v : β} : getValueD k (insertEntry k v l) fallback = v := by
   simp [getValueD_insertEntry, BEq.refl]
 
-@[simp]
+@[local simp]
 theorem containsKey_insertEntry [BEq α] [PartialEquivBEq α] {l : List ((a : α) × β a)} {k a : α}
     {v : β k} : containsKey a (insertEntry k v l) = ((k == a) || containsKey a l) := by
   rw [containsKey_eq_isSome_getEntry?, containsKey_eq_isSome_getEntry?, getEntry?_insertEntry]
@@ -983,7 +983,6 @@ theorem containsKey_insertEntry_of_beq [BEq α] [PartialEquivBEq α] {l : List (
     {k a : α} {v : β k} (h : k == a) : containsKey a (insertEntry k v l) := by
   simp [h]
 
-@[simp]
 theorem containsKey_insertEntry_self [BEq α] [EquivBEq α] {l : List ((a : α) × β a)} {k : α}
     {v : β k} : containsKey k (insertEntry k v l) :=
   containsKey_insertEntry_of_beq BEq.refl

src/Std/Sat/CNF/Basic.lean

@@ -132,7 +132,7 @@ theorem any_not_isEmpty_iff_exists_mem {f : CNF α} :
       | inl hl => exact Exists.intro _ hl
       | inr hr => exact Exists.intro _ hr
 
-@[simp] theorem not_exists_mem : (¬ ∃ v, Mem v f) ↔ ∃ n, f = List.replicate n [] := by
+theorem not_exists_mem : (¬ ∃ v, Mem v f) ↔ ∃ n, f = List.replicate n [] := by
   simp only [← any_not_isEmpty_iff_exists_mem]
   simp only [List.any_eq_true, Bool.not_eq_true', not_exists, not_and, Bool.not_eq_false]
   induction f with
@@ -153,8 +153,8 @@ theorem any_not_isEmpty_iff_exists_mem {f : CNF α} :
 instance {f : CNF α} [DecidableEq α] : Decidable (∃ v, Mem v f) :=
   decidable_of_iff (f.any fun c => !c.isEmpty) any_not_isEmpty_iff_exists_mem
 
-@[simp] theorem not_mem_nil {v : α} : ¬Mem v ([] : CNF α) := by simp [Mem]
-@[simp] theorem mem_cons {v : α} {c} {f : CNF α} :
+theorem not_mem_nil {v : α} : ¬Mem v ([] : CNF α) := by simp [Mem]
+@[local simp] theorem mem_cons {v : α} {c} {f : CNF α} :
     Mem v (c :: f : CNF α) ↔ (Clause.Mem v c ∨ Mem v f) := by simp [Mem]
 
 theorem mem_of (h : c ∈ f) (w : Clause.Mem v c) : Mem v f := by