Does every language in BPP have a mapping reduction to ATM?
Yes.

Every decidable language reduces to $A_{\mathrm{TM}}$.

Every language in BPP is decidable because the definition requires that every execution of the probabilistic machine halts in polynomial time. So you can just simulate out all the possibilities and compute the probability that the machine accepts.