Let $L$ be a lattice and let $a,b,c,d \in L$. Show that:
$\theta(a,b) \subseteq \theta(c,d)$ iff $\langle a,b\rangle \in \theta(c,d)$
$\theta(a,b)=\theta(a \wedge b, a \vee b)$
Where $\theta$ is a congruence. Definition: given a lattice $L$, a congruence $\theta$ on $L$ is an equivalence relation, compatible with the lattice operations, i.e. if $x_1\theta x_2$ and $y_1 \theta y_2$, then $x_1 \wedge x_2 \theta y_1 \wedge y_2$ and $x_1 \vee x_2 \theta y_1 \vee y_2$.
I specially have a problem with the first part, how to prove that it is a subset. The part of $\Leftarrow$ seems "evident", I have 2 elements, $a,b$, I assume they belong to the congruence, so they have to be inside, but I don't get the more formal way to explain this. For the $\Rightarrow$ part, I assume that $\theta (a,b) \subseteq \theta (c,d)$, so I think I have to argue that all the elements of a subset have a certain characteristic, so in particular $a,b$ have it. Again, if this is right, I am having trouble translating it into a proper proof.
About the second one, I can only think of proving it in a way similar to let $a= a\wedge b$ so $b = a\vee b$ (I have a lemma that $a= a\wedge b$ iff $b = a\vee b$). But it seems like there is something missing. I would very much appreciate your help to sort this out, and your input on how I can write this properly.