Theorems · Theorem · order theory
Submodule.mem_iSup_of_mem
∀ {R : Type u_1} {M : Type u_3} [inst : Semiring R] [inst_1 : AddCommMonoid M] [inst_2 : Module R M] {ι : Sort u_4}
{b : M} {p : ι → Submodule R M} (i : ι), b ∈ p i → b ∈ ⨆ i, p i- Defined in
- Mathlib.Algebra.Module.Submodule.Lattice
- Cited by
- 20 results in Mathlib
- Foundations
- Depth 64 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.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by20
Results whose statement or proof uses this declaration.
- Submodule.iSup_induction'statement and proof · cited by 5
- CliffordAlgebra.ι_mul_ι_mem_evenOdd_zeroproof · cited by 4
- Submodule.iSup_spanproof · cited by 3
- Submodule.sum_mem_biSupproof · cited by 2
- CliffordAlgebra.evenOdd_inductionstatement and proof · cited by 2
- LinearMap.charpoly_nilpotent_tfaeproof · cited by 2
- Submodule.iSup_smulproof · cited by 2
- Submodule.sum_mem_iSupproof · cited by 1
- hasEigenvalue_toLin_diagonal_iffproof · cited by 1
- Submodule.biSup_eq_range_dfinsupp_lsumproof · cited by 1
- CliffordAlgebra.odd_inductionproof · cited by 1
- Submodule.closure_coe_iSup_map_singleproof · cited by 1