Given the below problem:

Show that L = {<r> | r is a regular expression describing a language such that every string is of even length} is decidable.

Can we prove it this way:

Since languge of this problem is a regular language because it is described by a regular expression. And regular langugae is subset of decidable language (or contained in decidable languages) so L is also decidable.