Translate the following inference to logic notation: For all x, x_3 is happy if and only if x_3 is a lawyer. For all x, x_3 is happy if and only if x_3 will make tea. There is at least one x for which x_3 will not make tea. Therefore there is at least one x for which x_3 is not a lawyer.
forall x: P(x) <-> Q(x). forall x: P(x) <-> R(x). exists x: ~R(x). Therefore exists x: ~Q(x).