universal quantification of a conditional statement can also be explained as like this,
∀x(x < 0 → x2> 0)= let x1,x2,x3,.... are instances of x, according to definition of universal quantification, we can elaborate this as,
x1<0, x12 >0 and x2<0, x22 >0 and x3<0, x32 >0 ..........
if any statement is false, the whole equation is false, so all statement must be true, for final equation to be true,
in case of universal quantification of a conditional statement we apply case of less than 0 to every statement when it is processed,
in case of universal quantification,∀x < 0 (x2 > 0) we initially take out x which match condition less then 0, then make statement x2 > 0,
as you said these both mean same, but representation are different,
same is the case with existential quantification