Theorems · Theorem · combinatorics
Fin.insertNth_removeNth
∀ {n : ℕ} {α : Fin (n + 1) → Sort u_1} (p : Fin (n + 1)) (x : α p) (f : (j : Fin (n + 1)) → α j),
p.insertNth x (p.removeNth f) = Function.update f p x- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Function.updatestatement · cited by 502
- Function.update_selfproof · cited by 201
- Fin.insertNthstatement · cited by 95
- Fin.removeNthstatement and proof · cited by 53
- Fin.removeNth_updateproof · cited by 2
Cited by5
Results whose statement or proof uses this declaration.
- Fin.insertNth_self_removeNthproof · cited by 3
- MultilinearMap.uncurryMid_curryMidproof · cited by 1
- AlternatingMap.neg_one_pow_smul_map_removeNth_add_eq_zero_of_eqproof · cited by 1
- AlternatingMap.alternatizeUncurryFin_curryLeftproof · cited by 0
- ContinuousAlternatingMap.alternatizeUncurryFin_curryLeftproof · cited by 0