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