A combinatorial lemma on the cartesian product of finite sets

A sufficient condition for the cartesian product of a finite family of equipotent finite sets to have elements without repetitions is given, and some application is discussed