Theorems · Definition · combinatorics
Fin.removeNth
{n : ℕ} → {α : Fin (n + 1) → Sort u_1} → (p : Fin (n + 1)) → ((i : Fin (n + 1)) → α i) → (i : Fin n) → α (p.succAbove i)Remove the p-th entry of a tuple.
- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 53 results in Mathlib
- Foundations
- Depth 19 from the axioms · uses no axioms
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.succAbovestatement and proof · cited by 249
Cited by55
Results whose statement or proof uses this declaration.
- Fin.insertNthEquivproof · cited by 14
- ContinuousAlternatingMap.alternatizeUncurryFin_applystatement and proof · cited by 8
- Fin.insertNth_eq_iffstatement · cited by 6
- AlternatingMap.alternatizeUncurryFin_applystatement and proof · cited by 6
- Fin.removeNth_insertNthstatement · cited by 5
- Fin.insertNth_removeNthstatement and proof · cited by 5
- LinearMap.uncurryMidproof · cited by 5
- Fin.removeNth_removeNth_eq_swapstatement · cited by 3
- extDerivWithin_applystatement and proof · cited by 3
- Fin.insertNth_self_removeNthstatement · cited by 3
- Fin.insertNth_zeroproof · cited by 3
- LinearMap.uncurryMid_applystatement · cited by 3