Translate the following inference to logic notation: For all x, if x_1 were a cashier, then x_1 is cooking. For all x, x_1 is a cashier or x_1 will not cook. For all x, x_1 will not cook. Therefore for all x, x_1 is not a cashier.
forall x: P(x) -> Q(x). forall x: P(x) or ~Q(x). forall x: ~Q(x). Therefore forall x: ~P(x).