Theorems · Theorem · combinatorics
Fin.removeNth_removeNth_heq_swap
∀ {n : ℕ} {α : Fin (n + 2) → Sort u_3} (m : (i : Fin (n + 2)) → α i) (i : Fin (n + 1)) (j : Fin (n + 2)),
i.removeNth (j.removeNth m) ≍ (i.predAbove j).removeNth ((j.succAbove i).removeNth m)A HEq version of Fin.removeNth_removeNth_eq_swap.
- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 52 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- Fin.predAbovestatement and proof · cited by 75
- Fin.removeNthstatement and proof · cited by 53
- Function.hfunextproof · cited by 9
- congr_arg_heqproof · cited by 6
- Fin.succAbove_succAbove_succAbove_predAboveproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Fin.removeNth_removeNth_eq_swapproof · cited by 3