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