diff --git a/Mathlib/RingTheory/Ideal/IsPrimary.lean b/Mathlib/RingTheory/Ideal/IsPrimary.lean
index ae2680f21d1595..e7fa30fe72ebce 100644
--- a/Mathlib/RingTheory/Ideal/IsPrimary.lean
+++ b/Mathlib/RingTheory/Ideal/IsPrimary.lean
@@ -67,39 +67,21 @@ theorem isPrimary_of_isMaximal_radical {I : Ideal R} (hi : IsMaximal (radical I)
       rw [add_le_iff, span_singleton_le_iff_mem, ← hm.isPrime.radical_le_iff] at hy
       exact Or.inr (hi.eq_of_le hm.ne_top hy.1 ▸ hy.2)
 
-theorem isPrimary_inf {I J : Ideal R} (hi : I.IsPrimary) (hj : J.IsPrimary)
+theorem IsPrimary.inf {I J : Ideal R} (hi : I.IsPrimary) (hj : J.IsPrimary)
     (hij : radical I = radical J) : (I ⊓ J).IsPrimary :=
-  isPrimary_iff.mpr
-  ⟨ne_of_lt <| lt_of_le_of_lt inf_le_left (lt_top_iff_ne_top.2 hi.1),
-   fun {x y} ⟨hxyi, hxyj⟩ => by
-    rw [radical_inf, hij, inf_idem]
-    rcases (isPrimary_iff.mp hi).2 hxyi with hxi | hyi
-    · rcases (isPrimary_iff.mp hj).2 hxyj with hxj | hyj
-      · exact Or.inl ⟨hxi, hxj⟩
-      · exact Or.inr hyj
-    · rw [hij] at hyi
-      exact Or.inr hyi⟩
-
-open Finset in
-lemma isPrimary_finset_inf {ι} {s : Finset ι} {f : ι → Ideal R} {i : ι} (hi : i ∈ s)
+  Submodule.IsPrimary.inf hi hj (by simpa)
+
+@[deprecated (since := "2025-01-19")]
+alias isPrimary_inf := IsPrimary.inf
+
+lemma isPrimary_finsetInf {ι} {s : Finset ι} {f : ι → Ideal R} {i : ι} (hi : i ∈ s)
     (hs : ∀ ⦃y⦄, y ∈ s → (f y).IsPrimary)
     (hs' : ∀ ⦃y⦄, y ∈ s → (f y).radical = (f i).radical) :
-    IsPrimary (s.inf f) := by
-  classical
-  induction s using Finset.induction_on generalizing i with
-  | empty => simp at hi
-  | insert a s ha IH =>
-    rcases s.eq_empty_or_nonempty with rfl | ⟨y, hy⟩
-    · simp only [insert_empty_eq, mem_singleton] at hi
-      simpa [hi] using hs
-    simp only [inf_insert]
-    have H : ∀ ⦃x : ι⦄, x ∈ s → (f x).radical = (f y).radical := by
-      intro x hx
-      rw [hs' (mem_insert_of_mem hx), hs' (mem_insert_of_mem hy)]
-    refine isPrimary_inf (hs (by simp)) (IH hy ?_ H) ?_
-    · intro x hx
-      exact hs (by simp [hx])
-    · rw [radical_finset_inf hy H, hs' (mem_insert_self _ _), hs' (mem_insert_of_mem hy)]
+    IsPrimary (s.inf f) :=
+  Submodule.isPrimary_finsetInf hi hs (by simpa)
+
+@[deprecated (since := "2026-01-19")]
+alias isPrimary_finset_inf := isPrimary_finsetInf
 
 lemma IsPrimary.comap {I : Ideal S} (hI : I.IsPrimary) (φ : R →+* S) : (I.comap φ).IsPrimary := by
   rw [isPrimary_iff] at hI ⊢
diff --git a/Mathlib/RingTheory/IsPrimary.lean b/Mathlib/RingTheory/IsPrimary.lean
index f987724710cbf7..d2f84c76881b4d 100644
--- a/Mathlib/RingTheory/IsPrimary.lean
+++ b/Mathlib/RingTheory/IsPrimary.lean
@@ -6,6 +6,7 @@ Authors: Yakov Pechersky
 module
 
 public import Mathlib.LinearAlgebra.Quotient.Basic
+public import Mathlib.RingTheory.Ideal.Colon
 public import Mathlib.RingTheory.Ideal.Operations
 
 /-!
@@ -49,10 +50,43 @@ variable {R M : Type*} [CommSemiring R] [AddCommMonoid M] [Module R M]
 protected def IsPrimary (S : Submodule R M) : Prop :=
   S ≠ ⊤ ∧ ∀ {r : R} {x : M}, r • x ∈ S → x ∈ S ∨ ∃ n : ℕ, (r ^ n • ⊤ : Submodule R M) ≤ S
 
-variable {S : Submodule R M}
+variable {S T : Submodule R M}
 
 lemma IsPrimary.ne_top (h : S.IsPrimary) : S ≠ ⊤ := h.left
 
+lemma IsPrimary.mem_or_mem (h : S.IsPrimary) {r : R} {m : M} (hrm : r • m ∈ S) :
+    m ∈ S ∨ r ∈ (S.colon ⊤).radical :=
+  h.right hrm
+
+protected lemma IsPrimary.inf (hS : S.IsPrimary) (hT : T.IsPrimary)
+    (h : (S.colon Set.univ).radical = (T.colon Set.univ).radical) :
+    (S ⊓ T).IsPrimary := by
+  obtain ⟨_, hS⟩ := hS
+  obtain ⟨_, hT⟩ := hT
+  refine ⟨by grind, fun ⟨hS', hT'⟩ ↦ ?_⟩
+  simp_rw [← mem_colon_iff_le, ← Ideal.mem_radical_iff, inf_colon, Ideal.radical_inf,
+    top_coe, h, inf_idem, mem_inf, and_or_right] at hS hT ⊢
+  exact ⟨hS hS', hT hT'⟩
+
+open Finset in
+lemma isPrimary_finsetInf {ι : Type*} {s : Finset ι} {f : ι → Submodule R M} {i : ι} (hi : i ∈ s)
+    (hs : ∀ ⦃y⦄, y ∈ s → (f y).IsPrimary)
+    (hs' : ∀ ⦃y⦄, y ∈ s → ((f y).colon Set.univ).radical = ((f i).colon Set.univ).radical) :
+    (s.inf f).IsPrimary := by
+  classical
+  induction s using Finset.induction_on generalizing i with
+  | empty => simp at hi
+  | insert a s ha IH =>
+    rcases s.eq_empty_or_nonempty with rfl | ⟨y, hy⟩
+    · simp only [insert_empty_eq, mem_singleton] at hi
+      simpa [hi] using hs
+    simp only [inf_insert]
+    have H ⦃x⦄ (hx : x ∈ s) : ((f x).colon Set.univ).radical = ((f y).colon Set.univ).radical := by
+      rw [hs' (mem_insert_of_mem hx), hs' (mem_insert_of_mem hy)]
+    refine IsPrimary.inf (hs (by simp)) (IH hy (fun x hx ↦ hs (by simp [hx])) H) ?_
+    rw [colon_finsetInf, Ideal.radical_finset_inf hy H,
+      hs' (mem_insert_self _ _), hs' (mem_insert_of_mem hy)]
+
 end CommSemiring
 
 section CommRing
diff --git a/Mathlib/RingTheory/Lasker.lean b/Mathlib/RingTheory/Lasker.lean
index 6204ba3b1156e7..07a07059aa5d5c 100644
--- a/Mathlib/RingTheory/Lasker.lean
+++ b/Mathlib/RingTheory/Lasker.lean
@@ -72,7 +72,7 @@ lemma isPrimary_decomposition_pairwise_ne_radical {I : Ideal R}
   · simp only [Finset.mem_image, exists_exists_and_eq_and, forall_exists_index, and_imp,
     forall_apply_eq_imp_iff₂]
     intro J hJ
-    refine isPrimary_finset_inf (i := J) ?_ ?_ (by simp)
+    refine isPrimary_finsetInf (i := J) ?_ ?_ (by simp)
     · simp [hJ]
     · simp only [Finset.mem_filter, id_eq, and_imp]
       intro y hy