Translate the following inference to logic notation: For all x, if y makes tea, then y is sad. For all x, if y were sad, then y is making tea. Therefore for all x, y will make tea if and only if y is sad.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). Therefore forall x: P(x) <-> Q(x).