Why did Alan Turing have to define computation before demonstrating undecidability?
Without fixing a concrete model of computation, you can't show that you can actually do the "then construct" part of your argument, so it's not a proof.