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