Translate the following inference to logic notation: For all x, x_4 is a bartender. For all x, x_4 is a server. Therefore there is at least one x for which x_4 is a bartender and x_4 is a server.
forall x: P(x). forall x: Q(x). Therefore exists x: P(x) and Q(x).