Translate the following inference to logic notation: For all x, if x_2 goes running, then x_2 is working. For all x, if x_2 works, then x_2 is running. Joseph is not working. Therefore Joseph is not running.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). ~Q(a). Therefore ~P(a).