Here is your proof.
I will show you this proof so that you know what Linear Algebra is all about. It is about putting ideas together.
Proof:
We will proceed by proving the contrapositive of the theorem.
We are given that v1...vk is a set of Linear Independent vectors
Suppose {v1...vk, u} is a linearly dependent set.
(we need to show that u can be written as a linear combination of {v1,...,vk}
Case 1: u=0.
Then u = 0v1 + ... +0vn.
(So we wrote u as a linear combination of {v1,...,vn})
Case 2: u is not the zero vector.
Since v1...vk is a set of Linear Independent vectors we know that the only linear combination that sums to the zero vector is the trivial one.
(**)Since {v1...vk, u} is a linearly dependent set we know that there exists c1, ..., ck, b where c1,...,ck, b are not all 0, such that
c1v1 + c2v2 +...+ cmvk + bu = 0.
Claim b =/= 0. Suppose b=0.
Then c1v1 + c2v2 +...+ cmvk + bu =c1v1 + c2v2 +...+ cmvk= 0. But c1v1 + c2v2 +...+ cmvk= 0 implies c1=...=ck =0 since {v1,...,vk} is given to be linear independent. So ALL the scalars c1=....=ck=b=0. But by ** this is not true. So b=/=0
We know (from above) that c1v1 + c2v2 +...+ cmvk + bu = 0 with b=/0. Now you can write u as a Linear Combination of v1,...vn.
Combining both cases we see that we can write u as a linear combination of {v1,...vk}.
Is this clear?