Theorems · Theorem · commutative algebra
Submodule.exists_forall_notMem_of_forall_ne_top
∀ {ι : Type u_1} {K : Type u_2} {M : Type u_3} [inst : Field K] [inst_1 : AddCommGroup M] [inst_2 : Module K M]
[Finite ι] [Infinite K] (p : ι → Submodule K M), (∀ (i : ι), p i ≠ ⊤) → ∃ x, ∀ (i : ι), x ∉ p i- Defined in
- Mathlib.Algebra.Module.Submodule.Union
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites18
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
- AddCommGroupstatement and proof · cited by 12,871
- Top.topstatement and proof · cited by 9,680
- SetLike.coeproof · cited by 8,199
- Fintypeproof · cited by 7,736
- Fieldstatement and proof · cited by 7,404
- Submodulestatement and proof · cited by 7,192
- Set.univproof · cited by 3,945
- Finset.univproof · cited by 3,473
- Finitestatement and proof · cited by 3,029
- Set.iUnionproof · cited by 2,483
- Fintype.cardproof · cited by 1,386
Cited by1
Results whose statement or proof uses this declaration.
- Module.Dual.exists_forall_ne_zero_of_forall_existsproof · cited by 2