I'm trying to figure out if ${|A|}^{|P(A)|}=|P(P(A))|$ (where $A$ is infinite) is provable without the Axiom of Choice.
I know unconditionally we have the lower bound: $|A|^{|P(A)|}\geq 2^{|P(A)|}=|P(P(A))|$
If we assume the Axiom of Choice we can use Tarski's theorem about choice, that is $|X|=|X|^2$ for all infinite sets $|X|$ as well as the trivial bound $|X|<2^{|X|}=|P(X)|$ to get an upper bound:
$${|A|}^{|P(A)|}\leq{(2^{|A|})}^{|P(A)|}=2^{|A||P(A)|}\leq 2^{{|P(A)|}^2} = 2^{|P(A)|}=|P(P(A))|$$
Then with these lower and upper bounds for $|A|^{|P(A)|}$ and the Schroder-Bernstein Theorem we get the equivalence. However, I'm wondering is this can be achieved without the Axiom of Choice since the bound $|A|<2^{|A|}$ is rather generous. Also, I thought I saw somewhere that $|X|^{|Y|}=|P(Y)|$ as long as $|X|<|Y|$ but that may be wrong. Thanks.