Translate the following inference to logic notation: Karen is making 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.
P(a). forall x: Q(x). Therefore exists x: Q(x) and P(x).