Erdős Problem #219 — Arbitrarily Long Arithmetic Progressions of Primes

A set $s\subseteq\mathbb{N}$ is a prime arithmetic progression if every $p\in s$ is prime and there exists a natural number $l>0$ such that $s$ is an arithmetic progression of length $l$. Are there arbitrarily long arithmetic progressions of primes; equivalently, does every $N\in\mathbb{N}$ admit a prime arithmetic progression $s$ with $N\leq \operatorname{card}(s)$?