Mathlib Map

Theorems · Definition · combinatorics

DFunLike.fintype

(F : Type u_1) →
  {α : Type u_3} →
    {β : α → Type u_5} → [DFunLike F α β] → [DecidableEq α] → [Fintype α] → [(i : α) → Fintype (β i)] → Fintype F

All DFunLikes are finite if their domain and codomain are. This is not an instance because specific DFunLike types might have a better-suited definition. See also DFunLike.finite.

Defined in
Mathlib.Data.FunLike.Fintype
Cited by
0 results in Mathlib
Foundations
Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
DFunLikeDecidableEqFintypeFintype
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

FunLike.fintype · cited by 0FunLike.fintypeDFunLike.coe · cited by 62936DFunLike.coeFintype · cited by 7736FintypeDFunLike · cited by 576DFunLikeDFunLike.coe_injective · cited by 161DFunLike.coe_injectiveFintype.ofInjective · cited by 3Fintype.ofInjectiveDFunLike.fintypeCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.