Theorems · Inductive type · group theory
Monoid.CoprodI.Word
{ι : Type u_1} → (M : ι → Type u_2) → [(i : ι) → Monoid (M i)] → Type (max u_1 u_2)The type of reduced words. A reduced word cannot contain a letter 1, and no two adjacent
letters can come from the same summand.
- Defined in
- Mathlib.GroupTheory.CoprodI
- Cited by
- 55 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- Monoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Monoidstatement · cited by 3,887
Cited by86
Results whose statement or proof uses this declaration.
- Monoid.CoprodI.Word.toListstatement and proof · cited by 39
- Monoid.CoprodI.Word.fstIdxstatement and proof · cited by 30
- Monoid.CoprodI.Word.Pair.tailstatement · cited by 29
- Monoid.PushoutI.NormalWord.toWordstatement · cited by 18
- Monoid.CoprodI.Word.equivPairstatement and proof · cited by 18
- Monoid.CoprodI.Word.consstatement and proof · cited by 12
- Monoid.CoprodI.Word.emptystatement · cited by 12
- Monoid.CoprodI.Word.prodstatement and proof · cited by 11
- Monoid.CoprodI.Word.rconsstatement · cited by 10
- Monoid.CoprodI.Word.consRecOnstatement and proof · cited by 6
- Monoid.CoprodI.Word.Pair.mk.congr_simpstatement and proof · cited by 4
- Monoid.CoprodI.Word.extstatement and proof · cited by 4