chore: deprecate using non-deprecated names (#30057)

Found by the automated removal of deprecations in #30052, specifically [this commit](5a7cf54).

Author: adomani

Mathlib/Analysis/LocallyConvex/Basic.lean

@@ -170,7 +170,7 @@ theorem absorbent_iff_eventually_nhdsNE_zero :
 @[deprecated (since := "2025-03-03")]
 alias absorbent_iff_eventually_nhdsWithin_zero := absorbent_iff_eventually_nhdsNE_zero
 
-alias ⟨Absorbent.eventually_nhdsNE_zero, _⟩ := absorbent_iff_eventually_nhdsWithin_zero
+alias ⟨Absorbent.eventually_nhdsNE_zero, _⟩ := absorbent_iff_eventually_nhdsNE_zero
 
 @[deprecated (since := "2025-03-03")]
 alias Absorbent.eventually_nhdsWithin_zero := Absorbent.eventually_nhdsNE_zero

Mathlib/CategoryTheory/Monoidal/Cartesian/Mon_.lean

@@ -123,7 +123,7 @@ def MonObj.ofRepresentableBy (F : Cᵒᵖ ⥤ MonCat.{w}) (α : (F ⋙ forget _)
 @[deprecated (since := "2025-03-07")]
 alias MonObjOfRepresentableBy := MonObj.ofRepresentableBy
 
-@[deprecated (since := "2025-09-09")] alias Mon_ClassOfRepresentableBy := MonObjOfRepresentableBy
+@[deprecated (since := "2025-09-09")] alias Mon_ClassOfRepresentableBy := MonObj.ofRepresentableBy
 
 /-- If `M` is a monoid object, then `Hom(X, M)` has a monoid structure. -/
 abbrev Hom.monoid : Monoid (X ⟶ M) where
@@ -268,7 +268,7 @@ alias MonObjOfRepresentableBy_yonedaMonObjRepresentableBy :=
 
 @[deprecated (since := "2025-09-09")]
 alias Mon_ClassOfRepresentableBy_yonedaMonObjRepresentableBy :=
-  MonObjOfRepresentableBy_yonedaMonObjRepresentableBy
+  MonObj.ofRepresentableBy_yonedaMonObjRepresentableBy
 
 /-- The yoneda embedding for `Mon_C` is fully faithful. -/
 def yonedaMonFullyFaithful : yonedaMon (C := C).FullyFaithful where

Mathlib/Data/Set/Pairwise/Basic.lean

@@ -177,7 +177,7 @@ theorem Pairwise.insert_of_symmetric_of_notMem (hs : s.Pairwise r) (hr : Symmetr
   (pairwise_insert_of_symmetric_of_notMem hr ha).2 ⟨hs, h⟩
 
 @[deprecated (since := "2025-05-23")]
-alias Pairwise.insert_of_symmetric_of_not_mem := Pairwise.insert_of_symmetric_of_notMem
+alias Pairwise.insert_of_symmetric_of_not_mem := Pairwise.insert_of_symmetric
 
 theorem pairwise_pair : Set.Pairwise {a, b} r ↔ a ≠ b → r a b ∧ r b a := by simp [pairwise_insert]