Translate the following inference to logic notation: For all x, if x_10 were a lawyer, then x_10 is a janitor. For all x, if x_10 were a janitor, then x_10 is a lawyer. For all x, x_10 is a lawyer if and only if x_10 will play tennis. For all x, if x_10 were a janitor, then x_10 is a lawyer. For all x, x_10 is not a janitor. Therefore for all x, x_10 will not play tennis.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: P(x) <-> R(x). forall x: Q(x) -> P(x). forall x: ~Q(x). Therefore forall x: ~R(x).