Translate the following inference to logic notation: For all x, x_10 is poor or x_10 is an artist. For all x, x_10 will drive a car if and only if x_10 will sleep. For all x, x_10 is not poor or x_10 is a poet. For all x, x_10 will not sleep. For all x, x_10 is an artist if and only if x_10 will drive a car. Therefore for all x, x_10 is a poet.
forall x: P(x) or Q(x). forall x: R(x) <-> S(x). forall x: ~P(x) or T(x). forall x: ~S(x). forall x: Q(x) <-> R(x). Therefore forall x: T(x).