Theorems · Inductive type · general algebraic systems
IsNegApply
(F : Type u_1) → (α : outParam (Type u_2)) → (β : outParam (Type u_3)) → [FunLike F α β] → [Neg β] → [Neg F] → Prop
IsNegApply F α β states for all f : F and x : α, (-f) x = -f x.
- Defined in
- Mathlib.Data.FunLike.IsApply
- Cited by
- 21 results in Mathlib
- Foundations
- Depth 3 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- FunLikestatement · cited by 2,560
Cited by32
Results whose statement or proof uses this declaration.
- neg_applystatement · cited by 96
- FunLike.coe_negstatement and proof · cited by 13
- IsNegApply.neg_applystatement and proof · cited by 1
- FunLike.addGroupstatement and proof · cited by 0
- ContinuousLinearMap.coe_neg'statement · cited by 0
- MeasureTheory.VectorMeasure.coe_negstatement · cited by 0
- CuspForm.coe_negstatement · cited by 0
- ContDiffMapSupportedIn.coe_negstatement · cited by 0
- SchwartzMap.neg_applystatement · cited by 0
- IsNegApply.casesOnstatement and proof · cited by 0
- QuadraticMap.coeFn_negstatement · cited by 0
- SlashInvariantForm.coe_negstatement · cited by 0