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