Exercise 5, § 6

Show that every intersection of graphs of equivalences on a set $E$ is the graph of an equivalence on $E$. Give an example of two equivalences on a set $E$ such that the union of their graphs is not the graph of an equivalence on $E$.