Lower bound for the number of inequalities representing a monotone Boolean function of $n$ variables

It is shown that there is a monotonic Boolean function whose representation by a system of linear inequalities with $n$ Boolean variables requires not less than
$$\binom{n}{[n/2]}n^{-1}$$
inequalities.