How are these problem variants that ask about the size of optimal solutions in NP?
Any vertex cover of size $k$ is a witness that the smallest one has at most size $k$. Hence, the questions


  Is there a vertex cover of size at most $k$?


and


  Does a smallest vertex have size at most $k$?


are equivalent.