Translate the following inference to logic notation: For all x, x_7 will drive a car if and only if x_7 is happy. For all x, x_7 will drive a car or x_7 is not a janitor. Therefore for all x, if x_7 were a janitor, then x_7 is happy.
forall x: P(x) <-> Q(x). forall x: P(x) or ~R(x). Therefore forall x: R(x) -> Q(x).