refactor: Lint

HepLean/Mathematics/Fin.lean

@@ -381,7 +381,8 @@ lemma equivCons_trans {n m k : ℕ} (e : Fin n ≃ Fin m) (f : Fin m ≃ Fin k)
     Fin.equivCons (e.trans f) = (Fin.equivCons e).trans (Fin.equivCons f) := by
   refine Equiv.ext_iff.mpr ?_
   intro x
-  simp [Fin.equivCons]
+  simp only [Nat.succ_eq_add_one, equivCons, Equiv.toFun_as_coe, Equiv.coe_trans,
+    Equiv.invFun_as_coe, Equiv.coe_fn_mk, Equiv.trans_apply]
   match x with
   | ⟨0, h⟩ => rfl
   | ⟨i + 1, h⟩ => rfl
@@ -391,7 +392,9 @@ lemma equivCons_castOrderIso {n m : ℕ} (h : n = m) :
     (Fin.equivCons (Fin.castOrderIso h).toEquiv) = (Fin.castOrderIso (by simp [h])).toEquiv := by
   refine Equiv.ext_iff.mpr ?_
   intro x
-  simp [Fin.equivCons]
+  simp only [Nat.succ_eq_add_one, equivCons, Equiv.toFun_as_coe, RelIso.coe_fn_toEquiv,
+    Equiv.invFun_as_coe, OrderIso.toEquiv_symm, Fin.symm_castOrderIso, Equiv.coe_fn_mk,
+    Fin.castOrderIso_apply]
   match x with
   | ⟨0, h⟩ => rfl
   | ⟨i + 1, h⟩ => rfl
@@ -399,7 +402,8 @@ lemma equivCons_castOrderIso {n m : ℕ} (h : n = m) :
 @[simp]
 lemma equivCons_symm_succ {n m : ℕ} (e : Fin n ≃ Fin m) (i : ℕ) (hi : i + 1 < m.succ) :
     (Fin.equivCons e).symm ⟨i + 1, hi⟩ = (e.symm ⟨i, Nat.succ_lt_succ_iff.mp hi⟩).succ := by
-  simp [Fin.equivCons]
+  simp only [Nat.succ_eq_add_one, equivCons, Equiv.toFun_as_coe, Equiv.invFun_as_coe,
+    Equiv.coe_fn_symm_mk]
   have hi : ⟨i + 1, hi⟩ = Fin.succ ⟨i, Nat.succ_lt_succ_iff.mp hi⟩ := by rfl
   rw [hi]
   rw [Fin.cons_succ]

HepLean/Mathematics/List.lean

@@ -80,12 +80,15 @@ lemma insertEquiv_get {α : Type} {r : α → α → Prop} [DecidableRel r] (a :
       trans (b :: List.orderedInsert r a l).get ∘ Fin.cast (by
         rw [List.orderedInsert_length]
         simp [List.orderedInsert_length])
-      · simp
+      · simp only [List.orderedInsert.eq_2, List.length_cons, Fin.zero_eta, Fin.mk_one]
         ext x
         match x with
         | ⟨0, h⟩ => rfl
         | ⟨Nat.succ x, h⟩ =>
-          simp
+          simp only [Nat.succ_eq_add_one, Function.comp_apply, Equiv.symm_trans_apply,
+            Equiv.symm_swap, OrderIso.toEquiv_symm, Fin.symm_castOrderIso, RelIso.coe_fn_toEquiv,
+            Fin.castOrderIso_apply, Fin.cast_mk, equivCons_symm_succ, List.get_eq_getElem,
+            List.length_cons, List.getElem_cons_succ]
           have hswap (n : Fin (b :: a :: l).length) :
               (a :: b :: l).get (Equiv.swap ⟨0, by simp⟩ ⟨1, by simp⟩ n) = (b :: a :: l).get n := by
             match n with

HepLean/PerturbationTheory/Wick/Algebra.lean

@@ -165,7 +165,6 @@ def koszulOrderMonoidAlgebra {I : Type} (r : I → I → Prop) [DecidableRel r]
   Finsupp.lift (MonoidAlgebra ℂ (FreeMonoid I)) ℂ (List I)
     (fun i => Finsupp.lsingle (R := ℂ) (List.insertionSort r i) (koszulSign r q i))
 
-@[simp]
 lemma koszulOrderMonoidAlgebra_ofList {I : Type} (r : I → I → Prop) [DecidableRel r]
     (q : I → Fin 2) (i : List I) :
     koszulOrderMonoidAlgebra r q (MonoidAlgebra.of ℂ (FreeMonoid I) i) =