Proving that Pre(L) is regular using automatas: Should I prove that Pre(L) is the semantic of the new automata?
If you are unsure whether it is right, yes, you should prove it!  This is a good general principle. If you are unsure whether or why a particular step is correct, there's a good chance a reader will be unsure, too -- so prove it in more detail until there is no doubt.