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