Theorem: list_drop_cons (Katydid/Std/Lists.lean)

State before:
α : Type u_1
n : ℕ
x : α
xs : List α
⊢ drop (n + 1) (x :: xs) = drop n xs
Tactic:
rw [drop]
State after:
no goals