Theorems · Theorem · group theory
Submonoid.closure_induction_right
∀ {M : Type u_1} [inst : Monoid M] {s : Set M} {motive : (m : M) → m ∈ Submonoid.closure s → Prop},
motive 1 ⋯ →
(∀ (x : M) (hx : x ∈ Submonoid.closure s) (y : M) (hy : y ∈ s), motive x hx → motive (x * y) ⋯) →
∀ {x : M} (h : x ∈ Submonoid.closure s), motive x h- Cited by
- 2 results in Mathlib
- Foundations
- Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Monoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- Set.preimageproof · cited by 4,946
- Monoidstatement and proof · cited by 3,887
- Submonoidstatement and proof · cited by 3,086
- MulOppositeproof · cited by 1,135
- MulOpposite.unopproof · cited by 268
- MulMemClass.mul_memstatement and proof · cited by 173
- Submonoid.closurestatement and proof · cited by 167
- OneMemClass.one_memstatement and proof · cited by 87
- Submonoid.subset_closurestatement and proof · cited by 46
- Submonoid.closure_induction_leftproof · cited by 4
- Submonoid.op_closureproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Submonoid.induction_of_closure_eq_top_rightproof · cited by 0
- CoxeterSystem.simple_induction_rightproof · cited by 0