Translate the following inference to logic notation: For all x, if x writes a letter, then x is a server. For all x, if x were a server, then x is writing a letter. There is at least one x for which if x were a server, then x is writing a letter. Therefore there is at least one x for which if x were a server, then x is writing a letter.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). exists x: Q(x) -> P(x). Therefore exists x: Q(x) -> P(x).