Did Erdős prove there are two primes $4a+1, 4b+3$ between between $n$ and $2n$?

http://mathworld.wolfram.com/ChoquetTheory.html

Is the claim in the link true? Here's the reference given there:

https://www.renyi.hu/~p_erdos/1934-01.pdf

Erdős proved that there exist at least one prime $$\equiv 1\pmod{4}$$ and at least one prime $$\equiv 3\pmod{4}$$ between $$n$$ and $$2n$$ for all $$n>6$$.

References: Erdős, P. "A Theorem of Sylvester and Schur." J. London Math. Soc. 9, 282-288, 1934.

My question:

Can you find the proof of this in the given pdf (maybe somewhere else)?

EDIT: For those interested, there's a generalization of this fact:

• Is it an error calling the page "Choquet Theory"?? Is there an actual page on Choquet Theory that got switched with this one? Oct 17 '16 at 12:38

Yes, see the final page of

P. Erdos: Bizonyos számtani sorok törzsszámairól (On primes in some arithmetic progressions, in Hungarian), Bölcsészdoktori értekezés , Sárospatak, 1934, 1--20.

or its German translation:

P. Erdos: Über die Primzahlen gewisser arithmetischer Reihen (in German), Math. Z. 39 (1935), 473--491.

It looks like Erdos's proof only gives the result directly when $n > 6000$. But as he remarks, it is easy to lower this limit by a short, direct computation.

• This result (which Erdős indeed proved), was originally proven by Breusch, according to this and other sources: books.google.com/… Oct 5 '15 at 0:50
• @SteveKass It's also written on Breusch's Wikipedia page with $3$ references. Oct 5 '15 at 0:56
• It seems the MathWorld link might be misleading. It's not clear if there's a proof of this fact in the reference. Also, is it related to Choquet theory? And the MathWorld page should contain more references (any of these given here). Someone should edit the MathWorld link. Oct 5 '15 at 1:06
• The full text of Breusch’s paper is available here. eudml.org/doc/168326 It doesn’t address your original question, but it might be helpful to some readers. Oct 5 '15 at 2:02