Theorems · Definition · group theory

DistribMulActionHom.noConfusionType

Sort u →
  {M : Type u_1} →
    [inst : Monoid M] →
      {N : Type u_2} →
        [inst_1 : Monoid N] →
          {φ : M →* N} →
            {A : Type u_10} →
              [inst_2 : AddMonoid A] →
                [inst_3 : DistribMulAction M A] →
                  {B : Type u_11} →
                    [inst_4 : AddMonoid B] →
                      [inst_5 : DistribMulAction N B] →
                        (A →ₑ+[φ] B) →
                          {M' : Type u_1} →
                            [inst' : Monoid M'] →
                              {N' : Type u_2} →
                                [inst'_1 : Monoid N'] →
                                  {φ' : M' →* N'} →
                                    {A' : Type u_10} →
                                      [inst'_2 : AddMonoid A'] →
                                        [inst'_3 : DistribMulAction M' A'] →
                                          {B' : Type u_11} →
                                            [inst'_4 : AddMonoid B'] →
                                              [inst'_5 : DistribMulAction N' B'] → (A' →ₑ+[φ'] B') → Sort u

Defined in

Mathlib.GroupTheory.GroupAction.Hom

Cited by

0 results in Mathlib

Foundations

Depth 14 from the axioms · uses no axioms

Assumes

MonoidMonoidAddMonoidDistribMulActionAddMonoidDistribMulActionMonoidMonoidAddMonoidDistribMulActionAddMonoidDistribMulAction