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