Translate the following inference to logic notation: For all x, if x_8 plays squash, then x_8 is fast. For all x, if x_8 were an artist, then x_8 is playing squash. For all x, x_8 is an artist or x_8 is a mechanic. There is at least one x for which if x_8 were a mechanic, then x_8 is playing squash. Therefore there is at least one x for which x_8 is fast.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: R(x) or S(x). exists x: S(x) -> P(x). Therefore exists x: Q(x).