Can we explicitly define two ordinals $\alpha$ and $\beta$ in the language of $\{\in\}$ such that the following hold?
- ZFC proves that $\alpha$ and $\beta$ exist.
- ZFC proves that $\beth_\beta \neq \aleph_\alpha$
- The following statements are independent of ZFC: $$\aleph_\alpha \leq \beth_\beta,\qquad\beth_\beta \leq \aleph_\alpha$$
Doesn't this happen if $\alpha=\omega$ and $\beta=1$?
Fact 2 follows from Konig's theorem and fact 3 can be proved by forcing arguments.