I need to prove that
If relations $\rho$, $\sigma$ are both reflexive and symmetric, and their composition $\rho\sigma$ is symmetric, then $\rho\sigma = \rho\vee\sigma$.
It's obvious that $\rho\sigma$ includes all relations from both $\rho$ and $\sigma$, but I'm having hard time proving that it doesn't include extra relations.
Example of such case on set {1,2,3,4,5}:
$\rho$ (mark on $i$-th row and $j$-th column denotes $i\rho j$):
1 2 3 4 5
1 • •
2 • •
3 • •
4 • •
5 •
$\sigma$:
1 2 3 4 5
1 • •
2 • •
3 •
4 •
5 •
$\rho\sigma$:
1 2 3 4 5
1 • • •
2 • • •
3 • • •
4 • • •
5 •
$3\rho\sigma1$, but $3\bar{\rho}1$ and $3\bar{\sigma}1$.
I've tried reduction to the absurd, assuming that $\rho\sigma$ is symmetric and that there are some $x$,$y$,$w$ for which $x \bar{\rho} y$ and $x\bar{\sigma} y$, but $x \rho w\sigma y$. From symmetry of $\rho\sigma$ it follows that $y\rho q\sigma x$ for some $q$. But I can't figure out what to do next.
