Theorems · Definition · group theory

FunLike.subtractionCommMonoid

{F : Type u_1} →
  {α : Type u_2} →
    {β : Type u_3} →
      [inst : FunLike F α β] →
        [inst_1 : Add F] →
          [inst_2 : Zero F] →
            [inst_3 : SMul ℕ F] →
              [inst_4 : Neg F] →
                [inst_5 : Sub F] →
                  [inst_6 : SMul ℤ F] →
                    [inst_7 : SubtractionCommMonoid β] →
                      [IsZeroApply F α β] →
                        [IsAddApply F α β] →
                          [IsNegApply F α β] →
                            [IsSubApply F α β] → [IsSMulApply ℕ F α β] → [IsSMulApply ℤ F α β] → SubtractionCommMonoid F

A FunLike type is a subtraction commutative monoid if β is a subtraction commutative monoid.

Defined in

Mathlib.Data.FunLike.Group

Cited by

0 results in Mathlib

Foundations

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

Assumes

FunLikeAddZeroSMulNegSubSMulSubtractionCommMonoidIsZeroApplyIsAddApplyIsNegApplyIsSubApplyIsSMulApplyIsSMulApply