Theorems · Definition · group theory

DistribMulAction.compHom

{M : Type u_1} →
  {N : Type u_2} →
    (A : Type u_3) →
      [inst : AddMonoid A] →
        [inst_1 : Monoid M] → [DistribMulAction M A] → [inst_3 : Monoid N] → (N →* M) → DistribMulAction N A

Compose a DistribMulAction with a MonoidHom, with action f r' • m. See note [reducible non-instances].

Defined in

Mathlib.Algebra.GroupWithZero.Action.End

Cited by

0 results in Mathlib

Foundations

Depth 15 from the axioms · uses no axioms

Assumes

AddMonoidMonoidDistribMulActionMonoid