Theorems · Definition · general algebraic systems

IsMulApply.recOn

{F : Type u_1} →
  {α : Type u_2} →
    {β : Type u_3} →
      [inst : FunLike F α β] →
        [inst_1 : Mul β] →
          [inst_2 : Mul F] →
            {motive : IsMulApply F α β → Sort u} →
              (t : IsMulApply F α β) → ((mul_apply : ∀ (f g : F) (x : α), (f * g) x = f x * g x) → motive ⋯) → motive t

Defined in

Mathlib.Data.FunLike.IsApply

Cited by

0 results in Mathlib

Foundations

Depth 6 from the axioms · uses no axioms

Assumes

FunLikeMulMul