Translate the following inference to logic notation: For all x, if z were fast, then z is a cashier. For all x, if z were a mechanic, then z is fast. For all x, if z were fast, then z is a mechanic. For all x, if z were a cashier, then z is a mechanic. Therefore for all x, if z were a cashier, then z is fast.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: P(x) -> R(x). forall x: Q(x) -> R(x). Therefore forall x: Q(x) -> P(x).