Translate the following inference to logic notation: For all x, if x_6 makes tea, then x_6 is not a police officer. For all x, x_6 is a server if and only if x_6 will make tea. For all x, x_6 is a police officer. Therefore for all x, x_6 is not a server.
forall x: P(x) -> ~Q(x). forall x: R(x) <-> P(x). forall x: Q(x). Therefore forall x: ~R(x).