Theorems · Theorem · combinatorics
Fin.cons_zero
∀ {n : ℕ} {α : Fin (n + 1) → Sort u} (x : α 0) (p : (i : Fin n) → α i.succ), Fin.cons x p 0 = x- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 53 results in Mathlib
- Foundations
- Depth 31 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Fin.consstatement · cited by 190
Cited by53
Results whose statement or proof uses this declaration.
- Fin.cons_self_tailproof · cited by 9
- hasFDerivAtFilter_finConsproof · cited by 6
- Fin.update_cons_zeroproof · cited by 4
- Filter.Tendsto.finConsproof · cited by 3
- Set.mem_sum_list_ofFnproof · cited by 3
- Fin.insertNth_zeroproof · cited by 3
- Fin.append_left_eq_consproof · cited by 3
- Fin.cons_snoc_eq_snoc_consproof · cited by 3
- Set.iUnion_consproof · cited by 2
- Set.mem_prod_list_ofFnproof · cited by 2
- iteratedDerivWithin_vcomp_threeproof · cited by 2
- Submodule.basis_of_pid_auxproof · cited by 2