That just proves no Turing machine can be a halting oracle. To further conclude halting oracles are logically impossible requires the Total Turing Premise (TTP)::
Turing machines exhaust the set of all possible processes.
I don’t know the TTP has been proven. But if it has, then your argument holds and I’d concede ID is false.
Prima facie, TTP seems false because MI exists.