Prime numbers between n and 2n

Jelly, 4 bytes

‘æRḤ

Try it online!

waiting for OP's answer in comment...

(doesn't work for n=1)

Haskell, 45 bytes

-2 bytes thanks to BMO.

f n=[i|i<-[n+1..2*n],all((>0).mod i)[2..i-1]]

Try it online!

Pari/GP, 20 bytes

n->primes([n+1,2*n])

Try it online!