- #1

laminatedevildoll

- 211

- 0

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?