Can one reduce a problem of unknown complexity to a hard problem to show hardness?
The proof is not correct.  As you've indicated the reduction needs to go in the other direction, i.e. integer programming must be reduced to their problem, not the other way around.