Translate the following inference to logic notation: For all x, z will not play a game. For all x, z will play a game or z will not make tea. For all x, if z makes tea, then z is driving a car. For all x, z will drive a car if and only if z will make tea. Therefore for all x, z will not drive a car.
forall x: ~P(x). forall x: P(x) or ~Q(x). forall x: Q(x) -> R(x). forall x: R(x) <-> Q(x). Therefore forall x: ~R(x).