Theorems · Definition · group theory

DistribMulActionSemiHomClass.toDistribMulActionHom

{M : Type u_1} →
  [inst : Monoid M] →
    {N : Type u_2} →
      [inst_1 : Monoid N] →
        {φ : M →* N} →
          {A : Type u_4} →
            [inst_2 : AddMonoid A] →
              [inst_3 : DistribMulAction M A] →
                {B : Type u_5} →
                  [inst_4 : AddMonoid B] →
                    [inst_5 : DistribMulAction N B] →
                      {F : Type u_10} →
                        [inst_6 : FunLike F A B] → [DistribMulActionSemiHomClass F (⇑φ) A B] → F → A →ₑ+[φ] B

Turn an element of a type F satisfying DistribMulActionHomClass F M X Y into an actual DistribMulActionHom. This is declared as the default coercion from F to DistribMulActionHom M X Y.

Defined in

Mathlib.GroupTheory.GroupAction.Hom

Cited by

7 results in Mathlib

Foundations

Depth 13 from the axioms · uses no axioms

Assumes

MonoidMonoidAddMonoidDistribMulActionAddMonoidDistribMulActionFunLikeDistribMulActionSemiHomClass