Theorems · Theorem · combinatorics
Fin.repeat_succ
∀ {n : ℕ} {α : Sort u_1} (a : Fin n → α) (m : ℕ), Fin.repeat m.succ a = Fin.append a (Fin.repeat m a) ∘ Fin.cast ⋯- Defined in
- Mathlib.Data.Fin.Tuple.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 27 from the axioms · uses propext, 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.
- Function.Surjective.forallproof · cited by 214
- Fin.appendstatement · cited by 50
- Fin.append_leftproof · cited by 17
- Fin.append_rightproof · cited by 16
- Fin.repeatstatement and proof · cited by 9
- Fin.rightInverse_castproof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.