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