I'll throw it in here in case someone comes and might have an idea..
Let A:=N X N, and let <' be the following relation on A: <k1,n1><'<k2,n2> iff k1<k2 AND n1>n2. Now, I need to show that every chain of A is finite. I went around showing that the relation is a partial, non-strict order on A, and to show that A have minimal and maximal members (where the minimal members are <0,n> and the maximal are <k,0>). Now I try to approach this -