perf: increase prio of AddCommMonoid.toAddMonoid

Mathlib/Algebra/Group/Defs.lean

@@ -800,6 +800,10 @@ attribute [to_additive existing] isMulTorsionFree_iff
 /-- An additive commutative monoid is an additive monoid with commutative `(+)`. -/
 class AddCommMonoid (M : Type u) extends AddMonoid M, AddCommSemigroup M
 
+-- addition is commutative 99.9% of the time in mathematics,
+-- the essentially unique counterexample being ordinals.
+attribute [instance 1100] AddCommMonoid.toAddMonoid
+
 /-- A commutative monoid is a monoid with commutative `(*)`. -/
 @[to_additive]
 class CommMonoid (M : Type u) extends Monoid M, CommSemigroup M

Mathlib/Data/ENNReal/Basic.lean

@@ -180,7 +180,7 @@ variable {a b c d : ℝ≥0∞} {r p q : ℝ≥0} {n : ℕ}
 instance : IsOrderedMonoid ℝ≥0∞ where
   mul_le_mul_left _ _ := mul_le_mul_left
 
-instance : Unique (AddUnits ℝ≥0∞) where
+noncomputable instance : Unique (AddUnits ℝ≥0∞) where
   default := 0
   uniq a := AddUnits.ext <| nonpos_iff_eq_zero.1 <| by rw [← a.add_neg]; exact le_self_add
 

Mathlib/Data/Matrix/Basic.lean

@@ -431,7 +431,7 @@ theorem mapMatrix_neg [AddZeroClass α] [AddCommGroup β] (f : α →+ β) :
 @[simp]
 theorem mapMatrix_smul [Monoid A] [AddZeroClass α] [AddMonoid β] [DistribMulAction A β]
     (a : A) (f : α →+ β) :
-    (a • f).mapMatrix = (a • f.mapMatrix : Matrix m n α →+ _) := rfl
+    (a • f).mapMatrix = (a • (f.mapMatrix : Matrix m n α →+ _)) := rfl
 
 end AddMonoidHom
 

Mathlib/RingTheory/Polynomial/IsIntegral.lean

@@ -217,7 +217,7 @@ theorem MvPolynomial.isIntegral_iff_isIntegral_coeff.{w} {σ : Type w} {f : MvPo
             ((rename Subtype.val).comp
                 (killCompl (f := ((↑) : f.vars → σ)) Subtype.val_injective)).toRingHom
         · exact RingHom.ext (by simp [MvPolynomial.killCompl_map])
-        · nth_rw 1 12 [← hg]; simp)) n (.of_fintype _)
+        · simp [← hg])) n (.of_fintype _)
     · rw [← hg, coeff_rename_eq_zero _ _ _ (by grind)]
       exact isIntegral_zero
   revert f n