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