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