Theorems · Theorem · group theory
AddSubmonoid.closure_induction_left
∀ {M : Type u_1} [inst : AddMonoid M] {s : Set M} {motive : (m : M) → m ∈ AddSubmonoid.closure s → Prop},
motive 0 ⋯ →
(∀ (x : M) (hx : x ∈ s) (y : M) (hy : y ∈ AddSubmonoid.closure s), motive y hy → motive (x + y) ⋯) →
∀ {x : M} (h : x ∈ AddSubmonoid.closure s), motive x h- Cited by
- 3 results in Mathlib
- Foundations
- Depth 68 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites16
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- AddMonoidstatement and proof · cited by 2,864
- AddSubmonoidstatement · cited by 1,178
- map_addproof · cited by 964
- Subtype.propproof · cited by 505
- AddMemClass.add_memstatement and proof · cited by 229
- AddSubmonoid.closurestatement and proof · cited by 224
- ZeroMemClass.zero_memstatement and proof · cited by 162
- FreeAddMonoidproof · cited by 145
- FreeAddMonoid.ofproof · cited by 69
- AddSubmonoid.subset_closurestatement and proof · cited by 63
Cited by3
Results whose statement or proof uses this declaration.
- AddSubgroup.closure_induction_leftproof · cited by 2
- AddSubmonoid.induction_of_closure_eq_top_leftproof · cited by 2
- AddSubmonoid.closure_induction_rightproof · cited by 1