Translate the following inference to logic notation: For all x, x_16 will sleep if and only if x_16 will play tennis. For all x, if x_16 were a cashier, then x_16 is playing tennis. For all x, x_16 is bored if and only if x_16 will play a game. For all x, if x_16 sleeps, then x_16 is playing a game. For all x, x_16 is not bored. Therefore for all x, x_16 is not a cashier.
forall x: P(x) <-> Q(x). forall x: R(x) -> Q(x). forall x: S(x) <-> T(x). forall x: P(x) -> T(x). forall x: ~S(x). Therefore forall x: ~R(x).