Translate the following inference to logic notation: For all x, if x_10 goes running, then x_10 is a server. For all x, if x_10 were a server, then x_10 is running. For all x, x_10 will go running if and only if x_10 is a server. Therefore for all x, if x_10 goes running, then x_10 is a server.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: P(x) <-> Q(x). Therefore forall x: P(x) -> Q(x).