Theorems · Definition · commutative algebra

FunLike.module

{M : Type u_1} →
  {F : Type u_3} →
    {α : Type u_4} →
      {β : Type u_5} →
        [i : FunLike F α β] →
          [inst : Semiring M] →
            [inst_1 : AddCommMonoid β] →
              [inst_2 : Module M β] →
                [inst_3 : AddCommMonoid F] →
                  [inst_4 : SMul M F] → [IsZeroApply F α β] → [IsAddApply F α β] → [IsSMulApply M F α β] → Module M F

A FunLike type is a Module if β is a Module.

Defined in

Mathlib.Data.FunLike.Module

Cited by

0 results in Mathlib

Foundations

Depth 21 from the axioms · uses propext, Quot.sound

Assumes

FunLikeSemiringAddCommMonoidModuleAddCommMonoidSMulIsZeroApplyIsAddApplyIsSMulApply