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