Set.Finite

{α : Type u} → Set α → Prop

A set is finite if the corresponding Subtype is finite, i.e., if there exists a natural n : ℕ and an equivalence s ≃ Fin n.

Defined in: Mathlib.Data.Finite.Defs
Cited by: 1,814 results in Mathlib
Foundations: Depth 5 from the axioms, rests on 10 definitions · uses no axioms

Around this declaration

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

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

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 1,897.