Translate the following inference to logic notation: For all x, x_7 is not a soldier. There is at least one x for which if x_7 were a sailor, then x_7 is a soldier. For all x, if x_7 were a soldier, then x_7 is a sailor. Therefore there is at least one x for which x_7 is not a sailor.
forall x: ~P(x). exists x: Q(x) -> P(x). forall x: P(x) -> Q(x). Therefore exists x: ~Q(x).