Translate the following inference to logic notation: For all x, y_3 is an office clerk if and only if y_3 is happy. Patricia is happy. Therefore there is at least one x for which y_3 is an office clerk.
forall x: P(x) <-> Q(x). Q(a). Therefore exists x: P(x).