A Van der Waerden-free proof of Rado's theorem

We present a proof of the sufficiency of Rado’s condition for the partition regularity of linear Diophantine equations that avoids any use of van der Waerden’s theorem. The proof is based on fundamental properties that are common knowledge in combinatorics of numbers and is entirely elementary, with the sole exception of a standard application of the compactness principle.