Translate the following inference to logic notation: For all x, if x_10 cooks, then x_10 is a bartender. For all x, if x_10 cooks, then x_10 is a bartender. For all x, x_10 is not a carpenter. For all x, x_10 will cook if and only if x_10 is a carpenter. For all x, if x_10 were a bartender, then x_10 is cooking. Therefore for all x, x_10 is not a bartender.
forall x: P(x) -> Q(x). forall x: P(x) -> Q(x). forall x: ~R(x). forall x: P(x) <-> R(x). forall x: Q(x) -> P(x). Therefore forall x: ~Q(x).