Theorems · Definition · group theory
Function.Injective.rightCancelMonoid
{M₁ : Type u_1} →
{M₂ : Type u_2} →
[inst : Mul M₁] →
[inst_1 : One M₁] →
[inst_2 : Pow M₁ ℕ] →
[inst_3 : RightCancelMonoid M₂] →
(f : M₁ → M₂) →
Function.Injective f →
f 1 = 1 →
(∀ (x y : M₁), f (x * y) = f x * f y) →
(∀ (x : M₁) (n : ℕ), f (x ^ n) = f x ^ n) → RightCancelMonoid M₁A type endowed with 1 and * is a right cancel monoid, if it admits an injective map that
preserves 1 and * to a right cancel monoid. See note [reducible non-instances].
- Defined in
- Mathlib.Algebra.Group.InjSurj
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses no axioms
- Assumes
- MulOnePowRightCancelMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Monoidproof · cited by 3,887
- RightCancelMonoidstatement and proof · cited by 18
- RightCancelSemigroupproof · cited by 3
- Function.Injective.rightCancelSemigroupproof · cited by 0
- Function.Injective.monoidproof · cited by 0
Cited by2
Results whose statement or proof uses this declaration.
- FunLike.rightCancelMonoidproof · cited by 0
- Function.Injective.cancelMonoidproof · cited by 0