Theorems · Theorem · group theory
SubMulAction.closure_le
∀ {R : Type u_1} {M : Type u_2} [inst : SMul R M] {s : Set M} {p : SubMulAction R M},
SubMulAction.closure R s ≤ p ↔ s ⊆ ↑p- Cited by
- 2 results in Mathlib
- Foundations
- Depth 60 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- SMul
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SetLike.coestatement and proof · cited by 8,199
- LE.le.transproof · cited by 3,151
- SubMulActionstatement and proof · cited by 120
- SubMulAction.closurestatement and proof · cited by 6
- SubMulAction.subset_closureproof · cited by 4
- SubMulAction.mem_closureproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- SemigroupIdeal.closure_leproof · cited by 1
- SubMulAction.closure_monoproof · cited by 1