Translate the following inference to logic notation: For all x, x_6 will drive a car if and only if x_6 will make tea. For all x, if x_6 makes tea, then x_6 is driving a car. Therefore if Richard makes tea, then Richard is driving a car.
forall x: P(x) <-> Q(x). forall x: Q(x) -> P(x). Therefore Q(a) -> P(a).