The following is a (corollary of a) theorem of Sierpinskii from 1933:

If $\mu:\mathcal{P}(\Omega) \to [0,1]$ is a probability measure and $|\Omega|$ is smaller than the first inaccessible cardinal, then there must be a countable $A \subseteq \Omega$ such that $\mu(A)=1$.

The following is a (corollary of a) theorem of Sierpinskii from 1933:

If $\mu:\mathcal{P}(\Omega) \to [0,1]$ is a probability measure and $|\Omega|$ is smaller than the first weakly-inaccessible cardinal, then there must be a countable $A \subseteq \Omega$ such that $\mu(A)=1$.