Translate the following inference to logic notation: For all x, if x_16 were poor, then x_16 is playing squash. For all x, if x_16 plays squash, then x_16 is sleeping. For all x, if x_16 were poor, then x_16 is a scientist. There is at least one x for which x_16 is poor if and only if x_16 will sleep. Therefore there is at least one x for which if x_16 sleeps, then x_16 is a scientist.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: P(x) -> S(x). exists x: P(x) <-> R(x). Therefore exists x: R(x) -> S(x).