Translate the following inference to logic notation: For all x, x_10 is a cashier. For all x, if x_10 were a cashier, then x_10 is sleeping. If Thomas makes tea, then Sarah is not sleeping. Therefore Thomas is not making tea.
forall x: P(x). forall x: P(x) -> Q(x). p -> ~Q(a). Therefore ~p.