Theorems · Theorem · commutative algebra
Submodule.isPrimary_finsetInf
∀ {R : Type u_1} {M : Type u_2} [inst : CommSemiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M] {ι : Type u_3}
{s : Finset ι} {f : ι → Submodule R M} {i : ι},
i ∈ s →
(∀ ⦃y : ι⦄, y ∈ s → (f y).IsPrimary) →
(∀ ⦃y : ι⦄, y ∈ s → ((f y).colon Set.univ).radical = ((f i).colon Set.univ).radical) → (s.inf f).IsPrimary- Defined in
- Mathlib.RingTheory.IsPrimary
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 83 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Modulestatement and proof · cited by 20,661
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- CommSemiringstatement and proof · cited by 10,911
- Submodulestatement and proof · cited by 7,192
- Idealstatement and proof · cited by 4,748
- Set.univstatement and proof · cited by 3,945
- Finset.Nonemptyproof · cited by 1,001
- Finset.infstatement and proof · cited by 219
- Finset.induction_onproof · cited by 167
- Finset.mem_insert_selfproof · cited by 128
- Ideal.radicalstatement and proof · cited by 121
Cited by2
Results whose statement or proof uses this declaration.
- Submodule.isPrimary_decomposition_pairwise_ne_radicalproof · cited by 2
- Ideal.isPrimary_finsetInfproof · cited by 1