Formal target: Corpus.OEIS69923.conjecture

For any $n > 0$, is there always at least one prime $p$ such that $2^n \le p \le 2^n + \mathrm{prime}(n)$?

Exact formal statement

∀ (n : Nat), LT.lt.{0} 0 n → LE.le.{0} 1 (Corpus.OEIS69923.a n)

This target is a formal statement, not a proof of the problem.

Environment availability: available.