- #1
laminatedevildoll
- 211
- 0
How do I verify that R={(1,1). (2,2), (3,3) (3,2) (3,1), (2,1)} is an order relation on {1,2,3}.
So far, I have that an ordered set is a pair (X, <) where X is a set tand where < in a binary relation on X so that the following three properties are fulfilled:
1. reflexive prop
2. anti-symmetric prop
3. transitive prop
Do I have to prove each property for R?
So far, I have that an ordered set is a pair (X, <) where X is a set tand where < in a binary relation on X so that the following three properties are fulfilled:
1. reflexive prop
2. anti-symmetric prop
3. transitive prop
Do I have to prove each property for R?