Translate the following inference to logic notation: For all x, y_1 is a scientist if and only if y_1 will play tennis. For all x, if y_1 makes tea, then y_1 is playing tennis. There is at least one x for which y_1 will make tea. Therefore there is at least one x for which y_1 will play tennis.
forall x: P(x) <-> Q(x). forall x: R(x) -> Q(x). exists x: R(x). Therefore exists x: Q(x).