Theorems · Theorem · group theory

AddSubmonoid.iSup_induction

∀ {M : Type u_1} [inst : AddZeroClass M] {ι : Sort u_4} (S : ι → AddSubmonoid M) {motive : M → Prop} {x : M},
  x ∈ ⨆ i, S i →
    (∀ (i : ι), ∀ x ∈ S i, motive x) → motive 0 → (∀ (x y : M), motive x → motive y → motive (x + y)) → motive x

An induction principle for elements of ⨆ i, S i. If C holds for 0 and all elements of S i for all i, and is preserved under addition, then it holds for all elements of the supremum of S.

Defined in

Mathlib.Algebra.Group.Submonoid.Membership

Cited by

5 results in Mathlib

Foundations

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

Assumes

AddZeroClass