Translate the following inference to logic notation: For all x, x is poor if and only if x is fast. For all x, x is fast or x is not rich. For all x, x is not poor. There is at least one x for which if x were fast, then x is rich. Therefore there is at least one x for which x is not rich.
forall x: P(x) <-> Q(x). forall x: Q(x) or ~R(x). forall x: ~P(x). exists x: Q(x) -> R(x). Therefore exists x: ~R(x).