Theorems · Definition · order theory
Fin.succAbove
{n : ℕ} → Fin (n + 1) → Fin n → Fin (n + 1)succAbove p i embeds Fin n into Fin (n + 1) with a hole around p.
- Defined in
- Mathlib.Data.Fin.SuccPred
- Cited by
- 249 results in Mathlib
- Foundations
- Depth 18 from the axioms, rests on 90 definitions · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by268
Results whose statement or proof uses this declaration.
- Fin.insertNthstatement and proof · cited by 95
- Fin.removeNthstatement and proof · cited by 53
- Fin.succAbove_of_castSucc_ltstatement · cited by 39
- Matrix.det_fin_twoproof · cited by 33
- Fin.succAbove_of_le_castSuccstatement · cited by 33
- Fin.insertNth_apply_samestatement and proof · cited by 30
- Fin.insertNth_apply_succAbovestatement and proof · cited by 23
- finSuccEquiv'proof · cited by 20
- Fin.succAboveOrderEmbproof · cited by 15
- Fin.succAbove_laststatement · cited by 14
- Fin.insertNthEquivstatement and proof · cited by 14
- BoxIntegral.Box.faceproof · cited by 13
Showing the 200 most cited of 268.