Translate the following inference to logic notation: For all x, if x_10 writes a letter, then x_10 is rich. For all x, x_10 will write a letter or x_10 will read a book. For all x, x_10 is excited. For all x, x_10 will read a book if and only if x_10 is rich. Therefore John is excited.
forall x: P(x) -> Q(x). forall x: P(x) or R(x). forall x: S(x). forall x: R(x) <-> Q(x). Therefore S(a).