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