Translate the following inference to logic notation: For all x, if x_10 were a janitor, then x_10 is working. For all x, x_10 is a janitor or x_10 will not work. For all x, if x_10 works, then x_10 is a janitor. Therefore for all x, if x_10 were a janitor, then x_10 is working.
forall x: P(x) -> Q(x). forall x: P(x) or ~Q(x). forall x: Q(x) -> P(x). Therefore forall x: P(x) -> Q(x).