The Delsarte inequalities for binary code relate the code’s distance distribution (for all possible distances) to the so-called Krawtchouk numbers. This short paper gives an elementary proof of the inequalities by first proving the statement for distance 1 directly and then reducing the inequality for distance k to that for distance 1. Finally, a generalization of the Delsarte inequalities to general alphabets is formulated and proven.