Theorem: List.modifyHead_eq_modifyNth (One.lean)

State before:
α : Type u_1
f : α → α
l : List α
⊢ modifyHead f l = modifyNth f 0 l
Tactic:
simp only [modifyNth, modifyHead, modifyNthTail]
State after:
no goals