Translate the following inference to logic notation: For all x, if x_2 plays a game, then x_2 is making tea. For all x, x_2 will make tea or x_2 is not a cashier. For all x, x_2 is a cashier or x_2 will play a game. Therefore for all x, x_2 will make tea.
forall x: P(x) -> Q(x). forall x: Q(x) or ~R(x). forall x: R(x) or P(x). Therefore forall x: Q(x).