Translate the following inference to logic notation: For all x, x_5 is fast if and only if x_5 is a poet. Linda is a poet. Therefore there is at least one x for which x_5 is fast.
forall x: P(x) <-> Q(x). Q(a). Therefore exists x: P(x).