Translate the following inference to logic notation: For all x, if x_2 were a taxi driver, then x_2 is playing squash. For all x, if x_2 were curious, then x_2 is cooking. For all x, x_2 is a taxi driver or x_2 is curious. There is at least one x for which if x_2 cooks, then x_2 is playing squash. Therefore there is at least one x for which x_2 will play squash.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: P(x) or R(x). exists x: S(x) -> Q(x). Therefore exists x: Q(x).