Theorems · Definition · general algebraic systems
IsOneApplyEqSelf.recOn
{F : Type u_1} →
{α : Type u_2} →
[inst : FunLike F α α] →
[inst_1 : One F] →
{motive : IsOneApplyEqSelf F α → Sort u} →
(t : IsOneApplyEqSelf F α) → ((one_apply_eq_self : ∀ (x : α), 1 x = 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
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
- IsOneApplyEqSelfstatement and proof · cited by 12
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.