Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
The following statement cannot be proven in $\mathsf{ZFC}$:
(S) : If $A, B$ are sets with $|A| < |B|$, then $2^{|A|} = |{\cal P}(A)| < |{\cal P}(B)| = 2^{|B|}$.
Obviously, $\mathsf{GCH}$ implies (S). Does (S) imply $\mathsf{GCH}$ too?