A proof of a partition theorem for $[\mathbb Q]^n$

In this note we give a proof of Devlin's theorem via Milliken's theorem about weakly embedded subtrees of the complete binary tree $2^{<\mathbb N }$. Unlike the original proof which is (still unpublished) long and uses the language of category theory, our proof is short and uses direct combinatorial reasoning.