Translate the following inference to logic notation: For all x, if x were a bartender, then x is bored. For all x, if x were a bartender, then x is playing tennis. There is at least one x for which x is a bartender or x is not bored. Therefore there is at least one x for which if x were bored, then x is playing tennis.
forall x: P(x) -> Q(x). forall x: P(x) -> R(x). exists x: P(x) or ~Q(x). Therefore exists x: Q(x) -> R(x).