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