Is arithmetic coding restricted to powers of $2$ in denominator equivalent to Huffman coding?
You can't prove it because it's not true.

Arithmetic coding "degrades" to Huffman coding if all of the probabilities are of the form $2^{-k}$. Or, to put it another way, when the Kraft-McMillan inequality is an equality.