Translate the following inference to logic notation: For all x, y will make tea. For all x, y will play tennis. Therefore there is at least one x for which y will play tennis and y will make tea.
forall x: P(x). forall x: Q(x). Therefore exists x: Q(x) and P(x).