Condition (iv) says in particular that is an equivalence relation, so it is symmetric and transitive. It therefore implies (i) and (ii), closing the chain of implications.
Uniqueness is literal: if two equivalence relations both contain and are each contained in every such relation, each is contained in the other, so they are equal. Combining the preceding proofs gives
Their common relation is the equivalence relation generated by , and under these conditions it is already obtained by the two-step composite .

Articles by others on the same topic (0)

There are currently no matching articles.