By Ignatov's theorem the sets of values in an i.i.d. sequence that are the kth largest at their appearance (k = 1, 2, ···) are supports of i.i.d. Poisson processes. The present paper contains an elementary and short proof for the case where the underlying distribution function F is discrete, and then extends the result to general F.