Prove ALL$_{\text{TM}}$ is undecidable reduction problem
You can reduce from $H_{TM}$:

For input $&lt;M,w&gt;$ return (the encoding) for a machine $M_ {M,w}$ such that on input $x$:


Simulate $M(w)$
$Accept$


It’s easy to show
$M_{M,w} \in ALL_{TM} \leftrightarrow &lt;M,w&gt;\in H_{TM}$