Translate the following inference to logic notation: For all x, x_5 will drive a car or x_5 is an electrician. For all x, if x_5 plays tennis, then x_5 is driving a car. There is at least one x for which if x_5 were an electrician, then x_5 is playing tennis. For all x, if x_5 drives a car, then x_5 is playing tennis. Therefore there is at least one x for which x_5 will play tennis.
forall x: P(x) or Q(x). forall x: R(x) -> P(x). exists x: Q(x) -> R(x). forall x: P(x) -> R(x). Therefore exists x: R(x).