Show that if a graph is connected to k, then it is also connected to k-edge

Here is my thought, first if it is connected to k, then each vertex has a degree at least k. Therefore, the elimination of a set of edges of size K-1 will not produce any isolated vertex. I do not know how to continue.