Translate the following inference to logic notation: If Thomas works, then Robert is playing tennis. Thomas is working or Robert is not bored. For all x, if x_17 plays tennis, then x_17 is bored. Therefore if Robert plays tennis, then Thomas is working.
p -> P(a). p or ~Q(a). forall x: P(x) -> Q(x). Therefore P(a) -> p.