Theorems · Theorem · combinatorics
Fin.snoc_castSucc
∀ {n : ℕ} {α : Fin (n + 1) → Sort u_1} (x : α (Fin.last n)) (p : (i : Fin n) → α i.castSucc) (i : Fin n),
Fin.snoc p x i.castSucc = p i- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 38 results in Mathlib
- Foundations
- Depth 19 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.snocstatement · cited by 113
Cited by38
Results whose statement or proof uses this declaration.
- Fin.snoc_init_selfproof · cited by 7
- Fin.snoc_comp_castSuccproof · cited by 5
- Fin.snoc_injective2proof · cited by 3
- Fin.cons_snoc_eq_snoc_consproof · cited by 3
- IsPathConnected.exists_path_through_familyproof · cited by 2
- Filter.Tendsto.finSnocproof · cited by 2
- Fin.update_snoc_lastproof · cited by 2
- Fin.snoc_apply_zeroproof · cited by 2
- Fin.snoc_injective_of_injectiveproof · cited by 1
- SubMulAction.exists_smul_of_last_eqproof · cited by 1
- FirstOrder.Language.BoundedFormula.realize_toFormulaproof · cited by 1
- SubAddAction.exists_vadd_of_last_eqproof · cited by 1