Any subset of a finite set will be finite, but it is possible to have a subset of regular language which is not regular or a subset of CFL which is not CFL. For example language describing the halting problem is not recursive but is a proper subset of $\Sigma^*.$ which is regular and hence CFL too.