Translate the following inference to logic notation: For all x, if x_10 were an electrician, then x_10 is a sailor. For all x, if x_10 were a sailor, then x_10 is reading a book. For all x, if x_10 reads a book, then x_10 is an electrician. For all x, if x_10 were a cashier, then x_10 is not driving a car. For all x, x_10 will drive a car. For all x, x_10 is a cashier if and only if x_10 is a sailor. Therefore for all x, x_10 is not an electrician.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). forall x: S(x) -> ~T(x). forall x: T(x). forall x: S(x) <-> Q(x). Therefore forall x: ~P(x).