Prove that if ⩽ is a well-quasi-ordering on a set X, but not on [X]<ω, we can construct a bad sequence (An)n∈N in [X]<ω as follows: Given n∈N, assume inductively that for each i<n, Ai has already been defined, and there exists a bad sequence in [X]<ω starting with A0,…,An−1. (This is clearly true for n=0: by assumption, [X]<ω contains a bad sequence, which starts with the empty sequence.) Choose An∈[X]<ω such that there is a bad sequence in [X]<ω starting with A0,A1,…,An, and ∣An∣ is as small as possible.
Clearly, (An)n∈N is a bad sequence in [X]<ω; in particular, for all n, An=∅. For each n, choose an element an∈An, and let Bn:=An∖{an}.
By Corollary 12.1.2, the sequence (an)n∈N contains an infinite increasing subsequence (ani)i∈N. By the minimality of the choice of An0, the sequence
A0,…,An0−1,Bn0,Bn1,Bn2,…
is good. Consider a good pair; since (An)n∈N is bad, this pair cannot have the form (Ai,Aj) or (Ai,Bj) (note that Bj⩽Aj). Therefore, it must have the form (Bi,Bj). By extending the injection Bi→Bj with ai→aj, we conclude that (Ai,Aj) is good, which is a contradiction.