simp[Nat.min_eq_right lt, Nat.min_eq_right (le_of_lt lt), range_succ]
case succ.some.intro
α : Type u
inst✝¹ : DecidableEq α
β : Type v
inst✝ : DecidableEq β
n : ℕ
f : ℕ → α
m : ℕ
ih : take m (map f (range n)) = map f (range (min n m))
lt : m < n
hm : (range n).get? m = some m
⊢ map f (range (min n m)) ++ [f m] = map f (range (min n (m + 1)))
no goals