Given a relation $r$, define $r^{-1}$ to be the converse relation, and define $r \cdot r$ to be the usual "$x (r \cdot r) y$ if and only if there is $z$ such that $x r z$ and $z r y$".
Is it possible that relation $r$ in set A has this property that:
- $r^{-1}\subset r$ and $r^{-1} \neq r$
- $r\cdot r=r$ and $\forall x\in A \;\;(\neg\,x\,r\,x)$
I cannot find any example of relation which would have the first or the second property but I don't know how to start deal with it.