Theorems · Theorem · order theory
Submodule.mem_finsetInf
∀ {R : Type u_1} {M : Type u_3} [inst : Semiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M] {ι : Type u_4}
{s : Finset ι} {p : ι → Submodule R M} {x : M}, x ∈ s.inf p ↔ ∀ i ∈ s, x ∈ p i- Defined in
- Mathlib.Algebra.Module.Submodule.Lattice
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 65 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SemiringAddCommMonoidModule
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
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
- Semiringstatement and proof · cited by 13,802
- Finsetstatement and proof · cited by 13,712
- AddCommMonoidstatement and proof · cited by 12,281
- SetLike.coeproof · cited by 8,199
- Submodulestatement and proof · cited by 7,192
- Set.iInterproof · cited by 1,084
- Finset.infstatement · cited by 219
- Set.iInter_congr_Propproof · cited by 170
- Submodule.coe_finsetInfproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- IsArtinian.isSemisimpleModule_iff_jacobsonproof · cited by 1