Mathlib Map

Theorems · Theorem · combinatorics

Fin.removeNth_insertNth

∀ {n : ℕ} {α : Fin (n + 1) → Sort u_1} (p : Fin (n + 1)) (a : α p) (f : (i : Fin n) → α (p.succAbove i)),
  p.removeNth (p.insertNth a f) = f
Defined in
Mathlib.Data.Fin.Tuple.Basic
Cited by
5 results in Mathlib
Foundations
Depth 55 from the axioms · uses propext, Classical.choice, Quot.sound
Mathlib docsSourceLoogleLeanSearch

Around this declaration

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

Fin.update_insertNth · cited by 2Fin.update_insertNthFin.insertNth_update · cited by 0Fin.insertNth_updateLinearMap.curryMid_uncurryMid · cited by 0LinearMap.curryMid_uncurr…Fin.insertNth_mem_piFinset_insertNth · cited by 0Fin.insertNth_mem_piFinse…ContinuousLinearMap.curryMid_uncurryMid · cited by 0ContinuousLinearMap.curry…Fin.succAbove · cited by 249Fin.succAboveFin.insertNth · cited by 95Fin.insertNthFin.removeNth · cited by 53Fin.removeNthFin.insertNth_apply_succAbove · cited by 23Fin.insertNth_apply_succA…Fin.removeNth_insertNthCITED BYCITES

Cites4

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

Cited by5

Results whose statement or proof uses this declaration.