Translate the following inference to logic notation: For all x, if y_4 plays a game, then y_4 is driving a car. There is at least one x for which if y_4 were fast, then y_4 is playing a game. For all x, y_4 is fast if and only if y_4 is curious. Therefore there is at least one x for which if y_4 were curious, then y_4 is driving a car.
forall x: P(x) -> Q(x). exists x: R(x) -> P(x). forall x: R(x) <-> S(x). Therefore exists x: S(x) -> Q(x).