SCHWEITZER 1980 Problem 3

In a lattice, connected the elements $a \wedge b$ and $a \vee b$ by an edge whenever $a$ and $b$ are incomparable. Prove that in the obtained graph every connected component is a sublattice.

M. Ajtai