Translate the following inference to logic notation: For all x, x is not rich. For all x, if x were poor, then x is rich. For all x, if x plays squash, then x is poor. Therefore for all x, x will not play squash.
forall x: ~P(x). forall x: Q(x) -> P(x). forall x: R(x) -> Q(x). Therefore forall x: ~R(x).