Translate the following inference to logic notation: For all x, y_4 is rich. There is at least one x for which y_4 is not rich. Therefore there is at least one x for which y_4 is a bartender.
forall x: P(x). exists x: ~P(x). Therefore exists x: Q(x).