We prove an elementary proposition of combinatorial analysis, which with some use of model theory of Boolean algebras gives immediately the Erdös-Monk theorem. We shall proove also a generalization of this theorem.