Theorems · Definition · commutative algebra
FunLike.addAction
{M : Type u_1} →
{F : Type u_3} →
{α : Type u_4} →
{β : Type u_5} →
[i : FunLike F α β] →
[inst : VAdd M F] → [inst_1 : AddMonoid M] → [inst_2 : AddAction M β] → [IsVAddApply M F α β] → AddAction M FA FunLike type with scalar multiplication that satisfies (m • f) x = m • f x
is an AddAction if β is an AddAction.
- Defined in
- Mathlib.Data.FunLike.Module
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- AddMonoidstatement and proof · cited by 2,864
- FunLikestatement and proof · cited by 2,560
- AddActionstatement and proof · cited by 820
- VAddstatement and proof · cited by 616
- IsVAddApplystatement and proof · cited by 3
- Function.Injective.addActionproof · cited by 0
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.