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