 Theorem. (1) An inequation \(M\triangleright N\) is provable in \(\text{CL}_\triangleright\) if and only if \(v(M)\subseteq v(N)\) in any model for \(\text{CL}_\triangleright.\)  (2) An equation \(M = N\) is provable in \(\text{CL}_=\) if and only if \(v(M)=v(N)\) in any model for \(\text{CL}_=.\)