Translate the following inference to logic notation: There is at least one x for which if x takes a plane, then x is a janitor. For all x, x will take a plane. Therefore there is at least one x for which x is a janitor.
exists x: P(x) -> Q(x). forall x: P(x). Therefore exists x: Q(x).