Translate the following inference to logic notation: For all x, if x_5 were poor, then x_5 is running. There is at least one x for which if x_5 were a bartender, then x_5 is running. For all x, if x_5 goes running, then x_5 is poor. Therefore there is at least one x for which if x_5 were a bartender, then x_5 is poor.
forall x: P(x) -> Q(x). exists x: R(x) -> Q(x). forall x: Q(x) -> P(x). Therefore exists x: R(x) -> P(x).