Prove that in any lattice $(L,\leq)$ $$\forall x,y \in L ((x \wedge y = x\vee y) \Rightarrow (x = y)).$$
Could anyone give me an advice?
Prove that in any lattice $(L,\leq)$ $$\forall x,y \in L ((x \wedge y = x\vee y) \Rightarrow (x = y)).$$
Could anyone give me an advice?
Call $a=x\vee y$. $$\begin{cases}a=(x\wedge y)\le x\le (x\vee y)=a\\a=(x\wedge y)\le y\le (x\vee y)=a\end{cases}$$ So $x=a$ and $y=a$.