Translate the following inference to logic notation: For all x, x_5 will sleep if and only if x_5 will make tea. Mary is making tea. Therefore there is at least one x for which x_5 will sleep.
forall x: P(x) <-> Q(x). Q(a). Therefore exists x: P(x).