Help me understand this Turing-machine Problem concerning $A_{TM}$
Solving the language $L_1$ means knowing for every TM if it's semi-deciding the $A_{TM}$ problem.
Your instinct is right - it is empty and therefore decidable. If it wasn't empty by any chance, then by Rice's theorem it would have not been decidable