Translate the following inference to logic notation: For all x, if x_7 makes tea, then x_7 is poor. There is at least one x for which x_7 is not a bartender. For all x, x_7 is a bartender if and only if x_7 is poor. For all x, if x_7 were poor, then x_7 is making tea. Therefore there is at least one x for which x_7 will not make tea.
forall x: P(x) -> Q(x). exists x: ~R(x). forall x: R(x) <-> Q(x). forall x: Q(x) -> P(x). Therefore exists x: ~P(x).