By a famous theorem for every $n$ there is an arithmetic sequence of length $n$ consisting of primes.

Let $P(n)$ be the maximum length of an arithmetic progression of primes, has it been proven or disproven that $P(p)=p$ for every prime? If true this clearly generalizes the above theorem.