Translate the following inference to logic notation: For all x, if y_3 were a mechanic, then y_3 is not running. There is at least one x for which y_3 will go running. Therefore there is at least one x for which y_3 is not a mechanic.
forall x: P(x) -> ~Q(x). exists x: Q(x). Therefore exists x: ~P(x).