n-th prime number is less than $4^n$

The proof given in your book is very nice and elementary (certainly more elementary than Bertrand's postulate, let alone the prime number theorem), so I'll paraphrase it here. The key insight is that there are a lot of numbers out there that have to be expressible as products of primes (or primes and squares, in this proof), and this becomes impossible if there are too few primes to use.

Let $q$ denote the $n$th prime. Notice that every positive integer can be written (uniquely) as a square times a product of distinct primes. (This comes from its prime factorization; for example, $2^7 \cdot 3^5 \cdot 7^4 \cdot 11^2 \cdot 13 = (2^3 \cdot 3^2 \cdot 7^2 \cdot 11)^2 \cdot 2 \cdot 3 \cdot 13$. We allow the square to be $1^2$ when necessary, e.g. $35 = 1^2 \cdot 5 \cdot 7$, and similarly for there to be no extra primes, e.g. $36 = 6^2$.)

So let's express every integer between $1$ and $q$ in this way. For each integer $k$ in this range, we get a square and some set of primes. The square must be at most $q$ (or else $k$ would be greater than $q$), so there are at most $\sqrt q$ possible choices for it, namely $1^2, 2^2, \dots, \lfloor \sqrt q \rfloor^2$. Each of the primes must also be at most $q$, so they must be chosen from among the first $n$ primes, giving us $2^n$ possible choices for a subset. So there are at most $\sqrt q \cdot 2^n$ numbers that can be written in this very specific form. But wait: we just wrote $q$ different numbers in this form. So it must be that $q \leq \sqrt q \cdot 2^n$, which simplifies to $\sqrt q \leq 2^n$ and thus $q \leq 4^n$.

I don't believe you can find a proof that truly doesn't use induction, but consider:

"Chebyshev said it, and I'll say it again: there is always a prime between $n$ and $2n$."

I once asked this question which basically says $$\sqrt{p_n}<n$$ or $$\ln{p_n}<\sqrt{p_n}<n<n\ln{4} \Rightarrow \ln{p_n} < n\ln{4}\Rightarrow p_n < 4^n$$