Theorems · Theorem · group theory
SubAddAction.closure_le
∀ {R : Type u_1} {M : Type u_2} [inst : VAdd R M] {s : Set M} {p : SubAddAction R M},
SubAddAction.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
- VAdd
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- VAddstatement and proof · cited by 616
- SubAddActionstatement and proof · cited by 86
- SubAddAction.closurestatement and proof · cited by 6
- SubAddAction.subset_closureproof · cited by 4
- SubAddAction.mem_closureproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- AddSemigroupIdeal.closure_leproof · cited by 1
- SubAddAction.closure_monoproof · cited by 1