Theorems · Theorem · order theory
Submodule.sum_mem_biSup
∀ {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 ι} {f : ι → M} {p : ι → Submodule R M}, (∀ i ∈ s, f i ∈ p i) → ∑ i ∈ s, f i ∈ ⨆ i ∈ s, p i- Defined in
- Mathlib.Algebra.Module.Submodule.Lattice
- Cited by
- 2 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.
Cites9
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
- Submodulestatement and proof · cited by 7,192
- Finset.sumstatement · cited by 5,195
- iSupstatement · cited by 2,415
- sum_memproof · cited by 64
- Submodule.mem_iSup_of_memproof · cited by 20
Cited by2
Results whose statement or proof uses this declaration.
- iSupIndep_iff_finsetSum_eq_zero_imp_eq_zeroproof · cited by 3
- LinearMap.iInf_ker_proj_le_iSup_range_singleproof · cited by 2