Translate the following inference to logic notation: For all x, if x_10 were a cashier, then x_10 is happy. For all x, x_10 will not play tennis. For all x, x_10 is happy if and only if x_10 will play tennis. For all x, if x_10 were happy, then x_10 is a cashier. For all x, if x_10 were happy, then x_10 is a cashier. Therefore for all x, x_10 is not a cashier.
forall x: P(x) -> Q(x). forall x: ~R(x). forall x: Q(x) <-> R(x). forall x: Q(x) -> P(x). forall x: Q(x) -> P(x). Therefore forall x: ~P(x).