Consider the following language over $\sum=\{0,1\}$
$L=\{<M>|$ M is a turing machine that accepts all strings of length atmost 5 $\}$
Since, this is a non-trivial property of TM, so surely it is undecidable.
Now, Applying Rice’s Theorem part 2, $T_{yes}=\{0,1\}$ and $T_{no}=\sum^*$ and $T_{yes} \subset T_{no}$ so this is NOT RE.
Have I correctly applied property 2?