The answer to your question depends a little bit on your activation function. However, the main idea would always be that you find a third network $\phi_{\rm mult}$ that realises the function $(x,y) \mapsto xy$. Then you obtain a neural network that realises $fg$ by composing $\phi_f$, $\phi_g$ with $\phi_{\rm mult}$.
Two questions remain. 1. How does we compose neural networks and 2. how to construct the multiplication neural network $\phi_{\rm mult}$? The answer to the first question is spelled out in these lecture notes, Definition 2.9 and 2.10 and I do not want to repeat them, since that is a lot to write. As for how to construct $\phi_{\rm mult}$, things depend on the activation function.
If your activation function $\rho: \mathbb{R} \to \mathbb{R}$ is smooth and has non-zero second derivative, then the following trick can yield an approximation to a multiplication network:
Let $\xi$ be the point, where $\rho''(\xi) = : a \neq 0$, then using Taylor's theorem
$$
N \rho(x/ N +\xi) - N \rho(\xi) \to \rho'(\xi) x
$$
$$
N^2\rho(x/ N +\xi) - N^2 \rho(\xi) - N \rho'(\xi) x \to \frac{a}{2} x^2
$$
for $N \to \infty$ (I feel like I almost certainly made a mistake here, but you get the idea). Using this, you can construct a neural network $\phi_{\rm square}$ such that its realisation approximates $x \mapsto x^2$ arbitrarily well. Then, using
$$
(x+y)^2 - (x-y)^2 = 4xy
$$
you can construct from the squaring neural network an approximation to the multiplication.
If, on the other hand, your activation function is piecewise linear, then you need to work a bit more. Let's consider the case of $\rho$ being the ReLU, then you'll find a construction of $\phi_{\rm mult}$ in Proposition 3 of https://arxiv.org/pdf/1610.01145.pdf. For arbitrary p.w. linear activation functions the same statement holds.