I want clear and concise proof.

For every iN and language L, we create a new language chopi(L) by taking strings in L of length at least i and then removing the i leftmost symbols. Formally, chopi(L)={wvwL,withv=i} Show that if L is regular then so is chop1(L)