  Kelly's combinatorial lemma is a basic tool in the study of Ulam's
reconstruction conjecture. A generalization in terms of a family of t-elements
subsets of a v-element set was given by Pouzet. We consider a version of this
generalization modulo a prime p. We give illustrations to graphs and
tournaments.
