We prove a completeness theorem for a logic with both probability and first-order quantifiers in the case when the basic language contains only unary relation symbols.