Theorems · Theorem · group theory

AddSubmonoid.closure_induction_right

∀ {M : Type u_1} [inst : AddMonoid M] {s : Set M} {motive : (m : M) → m ∈ AddSubmonoid.closure s → Prop},
  motive 0 ⋯ →
    (∀ (x : M) (hx : x ∈ AddSubmonoid.closure s) (y : M) (hy : y ∈ s), motive x hx → motive (x + y) ⋯) →
      ∀ {x : M} (h : x ∈ AddSubmonoid.closure s), motive x h

Defined in

Mathlib.Algebra.Group.Submonoid.Membership

Cited by

1 results in Mathlib

Foundations

Depth 69 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

AddMonoid