Mathlib Map

Theorems · Definition · combinatorics

Fin.cons

{n : ℕ} → {α : Fin (n + 1) → Sort u} → α 0 → ((i : Fin n) → α i.succ) → (i : Fin (n + 1)) → α i

Adding an element at the beginning of an n-tuple, to get an n+1-tuple.

Defined in
Mathlib.Data.Fin.Tuple.Basic
Cited by
190 results in Mathlib
Foundations
Depth 30 from the axioms, rests on 162 definitions · uses propext

Around this declaration

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

Cites0

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

Nothing in Mathlib beyond the foundations.

Cited by201

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 201.