Translate the following inference to logic notation: For all x, if x_6 cooks, then x_6 is driving a car. For all x, x_6 will not work or x_6 is a doctor. For all x, x_6 is a doctor if and only if x_6 will drive a car. For all x, x_6 will work or x_6 will cook. Therefore for all x, x_6 will drive a car.
forall x: P(x) -> Q(x). forall x: ~R(x) or S(x). forall x: S(x) <-> Q(x). forall x: R(x) or P(x). Therefore forall x: Q(x).