Theorems · Theorem · combinatorics
Fin.univ_succAbove
∀ (n : ℕ) (p : Fin (n + 1)), Finset.univ = Finset.cons p (Finset.map p.succAboveEmb Finset.univ) ⋯
Embed Fin n into Fin (n + 1) by inserting
around a specified pivot p : Fin (n + 1) into the univ
- Defined in
- Mathlib.Data.Fintype.Basic
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Finset.univstatement and proof · cited by 3,473
- Compl.complproof · cited by 2,925
- Finset.mapstatement and proof · cited by 747
- Finset.consstatement · cited by 221
- Finset.cons_eq_insertproof · cited by 59
- Finset.map_eq_imageproof · cited by 50
- Finset.cons.congr_simpproof · cited by 13
- Fin.succAboveEmbstatement and proof · cited by 5
- Fin.image_succAbove_univproof · cited by 3
- Finset.insert_compl_selfproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- Fin.prod_univ_succAboveproof · cited by 9
- Fin.sum_univ_succAboveproof · cited by 3