As per my analysis they are not equivalent..
For this claim , we need to assign truth values in such a way that first 1st order logic is made false and 2nd order logic is made true or vice versa..
Let we take 3 pairs : (T , F) , (F , T) , (T , T).. the first in each pair being the truth values for x and the second one being for y..
Now ∀x P(x) will be false as well as ∀x Q(x)...
Hence the second 1st order logic : ∀x P(x) <==> ∀x Q(x) will evaluate to be true as both LHS and RHS are true and we know equivalence (biconditional) returns true when the truth values of LHS and RHS are same..
Now coming to the first of the given 1st order logic..We can clearly see 1st 2 tuples out of the three which I have taken invalidates the equivalence : P(x) <==> Q(x) as truth values dont match..
Hence ∀x ( P(x) <==> Q(x) ) automatically becomes false as one invalidation of 1st order logic means "for all" will return false..
So we have seen that for same tuples , first 1st order logic returns false and second one returns true ..Hence the given two 1st order logic statements are not equivalent..