Translate the following inference to logic notation: For all x, if x_11 plays a game, then x_11 is working. For all x, x_11 will write a letter or x_11 will not work. For all x, if x_11 writes a letter, then x_11 is playing squash. There is at least one x for which if x_11 takes a plane, then x_11 is playing a game. Therefore there is at least one x for which if x_11 takes a plane, then x_11 is playing squash.
forall x: P(x) -> Q(x). forall x: R(x) or ~Q(x). forall x: R(x) -> S(x). exists x: T(x) -> P(x). Therefore exists x: T(x) -> S(x).