On p. 111 (section 2.4) of Enderton's A Mathematical Introduction to Logic, immediately after the proof of the Generalization Theorem the following example is given
$$\forall x \forall y \alpha \vdash \forall y \forall x \alpha$$ without any explanation.
I cannot see right away how the Generalization Theorem can help here since that theorem allows us to add new quantifiers but here it seems we need some way of taking apart already existing quantifiers.
I would appreciate any help in understanding how this result (which of course must be true) serves as an example at this point in the book.