Pandigital Sum whose Components are Multiples

Theorem
The following sums use each of the digits $1$ to $9$ exactly once each, while one summand equals $2$ times the other summand:

It is interesting to note how the $4$ sums can be divided into two pairs in which each element of the sum is an anagram of its corresponding element in the other.