Would you say that rice's theorem is a generalization of the halting problem? It looks like "halting problem being unsolvable" -> "rice's theorem" by a subset

Would you say that rice's theorem is a generalization of the halting problem? It looks like "halting problem being unsolvable" -> "rice's theorem" by a subset relationship. Consequently, if rice's theorem were false, you could solve the halting problem by modus tollens. That being said, I had using the halting problem as my way of saying that identification of malicious software is impossible because infinite loops can be malicious and I had been unaware of rice's theorem. I will use that in my explanations in the future.