Decidability language, intersection
The language $A = \Sigma^*$ is coRE. Since $A \triangle B = \overline{B}$, the statement you are trying to prove implies RE=coRE, which is known to be false: for example, the set of all programs that halt is in RE but not in coRE.