Translate the following inference to logic notation: Jennifer is not a bartender. For all x, x_5 is poor or x_5 is not a bartender. For all x, if x_5 were poor, then x_5 is a bartender. Therefore Jennifer is not poor.
~P(a). forall x: Q(x) or ~P(x). forall x: Q(x) -> P(x). Therefore ~Q(a).