simp[take_succ, ih]
case succ
α : Type u
inst✝¹ : DecidableEq α
β : Type v
inst✝ : DecidableEq β
n : ℕ
f : ℕ → α
m : ℕ
ih : take m (map f (range n)) = map f (range (min n m))
⊢ take (m + 1) (map f (range n)) = map f (range (min n (m + 1)))
case succ
α : Type u
inst✝¹ : DecidableEq α
β : Type v
inst✝ : DecidableEq β
n : ℕ
f : ℕ → α
m : ℕ
ih : take m (map f (range n)) = map f (range (min n m))
⊢ map f (range (min n m)) ++ (Option.map f ((range n).get? m)).toList = map f (range (min n (m + 1)))