Theorems · Definition · group theory
FreeAddMonoid.recOn
{α : Type u_1} →
{motive : FreeAddMonoid α → Sort u_6} →
(xs : FreeAddMonoid α) →
motive 0 → ((x : α) → (xs : FreeAddMonoid α) → motive xs → motive (FreeAddMonoid.of x + xs)) → motive xsRecursor for FreeAddMonoid using 0 and
FreeAddMonoid.of x + xs instead of [] and x :: xs.
- Defined in
- Mathlib.Algebra.FreeMonoid.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 39 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FreeAddMonoidstatement and proof · cited by 145
- FreeAddMonoid.ofstatement and proof · cited by 69
Cited by8
Results whose statement or proof uses this declaration.
- TensorProduct.induction_onproof · cited by 81
- FreeAddMonoid.inductionOn'proof · cited by 6
- FreeAddMonoid.hom_eqproof · cited by 6
- PiTensorProduct.induction_on'proof · cited by 3
- FreeAddMonoid.closure_range_ofproof · cited by 3
- FreeAddMonoid.inductionOnproof · cited by 1
- FreeAddMonoid.recOn_of_addstatement · cited by 0
- FreeAddMonoid.recOn_zerostatement · cited by 0