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