Rice theorem Clarification

Question

I need to understand when to apply RICE's theorem and when to not.

Questions like:- Turing machine makes at least five moves,It  accepts a string  input of length atleast five ,TM halts for every input on length <50 are all decidable.

But  these  are  NON TRIVIAL properties?Some TM will make 5 moves and some will not,Some can halt on every input <50 and some can not?So if this is Non trivial property then why cant we apply RICE's theorem?

I was reading Arjun's sir blog on GateCse,there will say that TM accepts atleast 10 strings is undecidable because some TM will say yes and some will say NO.Then why can't we use same concept on above metioned questions?

Please help

Comments

Rice theorem is applied on non-trivial language properties .....above both properties are not language properties

---

Can you please give an example?Why cant we apply it here:- https://gateoverflow.in/100112/rices-theorem ,the way it was applied here http://gatecse.in/rices-theorem/

---

See the ans there