Is this a valid proof of this predicate statement? $\forall x [P(x) \rightarrow Q(x)] \Rightarrow [\forall x P(x) \rightarrow \forall x Q(x)]$
If the LHS is true, then Q(x) must be true for all values of x. Since Q(x) is true for any value, then Q(y) is always true. Thus the RHS is also always true.
 A: It is not a correct proof.  Say that $P(x)$ is the statement "$x$ is a ruby" and $Q(x)$ is the statement "$x$ is red". 
Your claim is:

If the LHS is true, then $Q(x)$ must be true for all values of $x$. 

The LHS,  $\forall x[P(x)\to Q(x)]$ is quite true, since for any $x$, if $x$ is a ruby then it is red.  But contrary to your claim, $Q(x)$ is not true for all values of $x$, since not every $x$ is red—crows are not red, and neither is snow.
(However, the RHS is still true; it says that if every $x$ were a ruby, then every $x$ would be red, and this is correct, if the LHS is. But your argument is wrong.)
A: MJD has given the right response. But what an extraordinary thing to say: 

If the LHS is true, then Q(x) must be true for all values of x

The LHS renders "Take anything $x$ you like, if (yes, IF) $Px$, then $Qx$". The 'if' is crucial. That you missed this suggests you badly need to get back to basics and have another look at a good exposition of the way we render statements of generality using quantifiers-and-variables in logic. I've mentioned it before here, but an excellent freely available resource is Paul Teller's A Modern Formal Logic Primer -- check out the first four chapters of Vol. II and you will never make a bad mistake like this again, promise! (Or of course get my Introduction to Formal Logic out of the library ...!)
