Intersection of equivalence relations is an equivalence relation Theorem:

Given a collection $S$ of equivalence relations on a set $X:=\left\{x_{1},...,x_{n}\right\}$, then the intersection of elements in $S$ is also an equivalence relation.

Proof (my try):
The intersection is not empty since all of the equivalence relations should be reflexive , in other words the identity relation $Id_X$  is contained in all of the elements in $S$, hence the least intersection that they can have is $Id_x$ which is itself an equivalence relation, but if it's not the intersection then there exist at least another ordered pair $\left(x_{i},x_{j}\right)$ in $Id_X$, but symmetry implies $\left(x_{j},x_{i}\right)$ $\left(1\le i<j\le n\right)$ is also  contained in $Id_X$, on the hand the other case would be that these ordered pairs by transitivity add another ordered pair, in all of these cases the relation is an equivalence.
Is my proof right?
Have someone any better proof?

I cannot say whether is right or wrong, since I don't understand what you wrote, other than the assertion that the intersection must contain $\operatorname{Id}_X$ and therefore it must be reflexive (which is correct, by the way).
Let $I$ be the intersection. Then $I$ is symmetric because if $x\mathrel Iy$, then $(x,y)$ belongs to every element of $S$. But every element of $S$ is symmetric and therefore $(y,x)$ also belongs to every element of $S$. In other words, $y\mathrel Ix$.
And $I$ is transitive to. If $x\mathrel Iy$ and $y\mathrel Iz$, then both pairs $(x,y)$ and $(y,z)$ belong to each element of $S$. Sense every element of $S$ is transitive, $(x,z)$ also belongs to every element of $S$. So, $x\mathrel Iz$.
