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