Translate the following inference to logic notation: There is at least one x for which if x_9 plays tennis, then x_9 is a cashier. For all x, x_9 will play tennis. For all x, x_9 is not a cashier. Therefore there is at least one x for which x_9 is a soldier.
exists x: P(x) -> Q(x). forall x: P(x). forall x: ~Q(x). Therefore exists x: R(x).