Showing that the set of DTMs that run forever is not Turing-recognizable The language A, that is all DTMS that run forever on input. 

Would this not just be the HALT problem?

Therefore no reduction or proof is necessary, other then stating that?

ANSWER FOUND:
I think i have it, if it was Turing Recognizable, then it would be possible to determine when HALT should reject and therefore HALT would be decidable. Since it is not-decidable, then A must be not Turing Recognizable.
This is not the halting problem, the halting problem is the set of TMs that do halt, the language $A$ is the set of TMs that don't halt. It's the complement of the halting problem.

You also seem to be mistaken in that the halting problem is recognizable, it's just not decidable.