Translate the following inference to logic notation: For all x, if x_9 plays squash, then x_9 is fast. For all x, if x_9 plays a game, then x_9 is reading a book. For all x, x_9 will play squash or x_9 will not read a book. For all x, if x_9 were rich, then x_9 is playing a game. Therefore for all x, if x_9 were rich, then x_9 is fast.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). forall x: P(x) or ~S(x). forall x: T(x) -> R(x). Therefore forall x: T(x) -> Q(x).