Translate the following inference to logic notation: For all x, x_4 will go running if and only if x_4 will drive a car. For all x, if x_4 drives a car, then x_4 is running. Therefore for all x, if x_4 drives a car, then x_4 is running.
forall x: P(x) <-> Q(x). forall x: Q(x) -> P(x). Therefore forall x: Q(x) -> P(x).