Search for question
Question

(b) (5 points) Suppose <= is a linear order on X such that every x E X has a <-successor. Let<=lex be the lexicographical ordering induced by <= on X².

Prove that every (x1, x2) E X has a <=lex-Successor. 1. (a) (5 points) Let X be a nonempty set and let R be a binary relation on X which is irreflexive and transitive. Prove that if x, y, z E X satisfy xRy and yRz, then x # z.

Fig: 1

Fig: 2