Ref request: A graph G contains H as a minor iff it contains one of finitely many graphs as a topological minor

For definitions of graph minors and topological minors, see wikipedia's article on graph minors.

Theorem: For every graph H, there is a finite set of graphs, say S(H), such that G contains H as a minor if and only if G contains some graph from S(H) as a topological minor.

Can anyone point me to a paper/book where this is proved? (I know how to prove it, I just want a reference to cite.)