We give a simple and elementary proof of Kriz's lower bound on the chromatic number of the Kneser r-hypergraph of a set system.
