Theorems · Definition · general algebraic systems
IsOneApply.casesOn
{F : Type u_1} →
{α : Type u_2} →
{β : Type u_3} →
[inst : FunLike F α β] →
[inst_1 : One β] →
[inst_2 : One F] →
{motive : IsOneApply F α β → Sort u} →
(t : IsOneApply F α β) → ((one_apply : ∀ (x : α), 1 x = 1) → motive ⋯) → motive t- Defined in
- Mathlib.Data.FunLike.IsApply
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- FunLikestatement and proof · cited by 2,560
- IsOneApplystatement and proof · cited by 12
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.