Translate the following inference to logic notation: For all x, x_5 is a bartender if and only if x_5 is fast. For all x, x_5 will read a book. There is at least one x for which if x_5 reads a book, then x_5 is fast. Therefore there is at least one x for which x_5 is fast.
forall x: P(x) <-> Q(x). forall x: R(x). exists x: R(x) -> Q(x). Therefore exists x: Q(x).