Share
Explore BrainMass

Well Ordered Set : Proof of Refelxive and Transitive under Relation

Trying to prove the following: A set "A" is called a well ordered set if there is a relation R on A such that R is reflexive, transitive, and for all a,b are elements of A, either aRb or bRa.

Prove that the set of the integers is a well-ordered set under the relation less than or equal to.

Would I just need to prove the less than or equal to is reflexive and transitive?
How would I do this?

Solution Summary

A well ordered set, refelxiveness, transitiveness are investigated under a relation. The solution is detailed and well presented.

$2.19