Translate the following inference to logic notation: For all x, if x_4 were a mechanic, then x_4 is a politician. For all x, x_4 is not a janitor or x_4 is fast. For all x, if x_4 were fast, then x_4 is a politician. For all x, x_4 is not a lawyer or x_4 is a mechanic. For all x, x_4 is a janitor or x_4 is a lawyer. Therefore for all x, x_4 is a politician.
forall x: P(x) -> Q(x). forall x: ~R(x) or S(x). forall x: S(x) -> Q(x). forall x: ~T(x) or P(x). forall x: R(x) or T(x). Therefore forall x: Q(x).