 Equivalently, for every binary relation with no decreasing infinite chains and satisfying a weak version of the diamond property, there is a unique minimal element in every connected component of the relation considered as a graph.Today, this is seen as a purely combinatorial result based on well-foundedness due to a proof of Gérard Huet in 1980.Newman's original proof was considerably more complicated.