So if we were able to assume the discrete log is hard, then we could prove that Diffie-Hellman is secure if we could show that breaking Diffie-Hellman implies that one can also solve the discrete log problem. 