Let R be a relation on a set A. Prove that
(a) if A is nonempty, the empty relation is not reflexive on A.
(b) the empty relation is symmetric and transitive for every set A.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.