DFA and regular languages

Question

I've been thinking about the following and I think the answer's in the affirmative.

Is it true that every subset of a DFA-acceptable language that is regular is also DFA-acceptable?