Prove the halting problem is undecidable using Rice's theorem
Your question contains a few hints at misunderstandings of the fundamentals that would take several pages to address. So let's focus on your final question:


  Is it actually possible to use Rice's theorem to prove that the halting problem is undecidable? 


No. Rice's theorem can only be used to show undecidability of index sets and the (usual) Halting problem can not be expressed as such. For details, see here and here.