Given sets A and B with a common ordering A and of elements of B by (a₁,a₂,...) < (b₁,b₂,...) if either a_i = b_i for every i, or a_n <b_n , where n is the first place in which they differ; this is the way words are ordered in a dictionary.