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