Translate the following inference to logic notation: For all x, x_11 will play tennis if and only if x_11 is curious. For all x, if x_11 were curious, then x_11 is working. For all x, x_11 will play tennis. Therefore for all x, x_11 will work or x_11 is poor.
forall x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: P(x). Therefore forall x: R(x) or S(x).