Symmetric Designs as the Solution of an Extremal Problem in Combinatorial Set Theory

We apply duality in the Johnson scheme J(v,k) to give a very short proof of a theorem of Frankl and Furedi.