Translate the following inference to logic notation: If Joseph works, then Robert is making tea. For all x, x_12 will work or x_12 will not drive a car. For all x, if x_12 works, then x_12 is driving a car. Therefore if Joseph drives a car, then Robert is making tea.
P(a) -> p. forall x: P(x) or ~Q(x). forall x: P(x) -> Q(x). Therefore Q(a) -> p.