Translate the following inference to logic notation: There is at least one x for which x_5 will make tea. For all x, x_5 is a writer and x_5 is fast. Therefore there is at least one x for which x_5 will make tea.
exists x: P(x). forall x: Q(x) and R(x). Therefore exists x: P(x).