Translate the following inference to logic notation: For all x, if z drives a car, then z is an electrician. For all x, if z reads a book, then z is working. There is at least one x for which if z works, then z is driving a car. For all x, if z were an electrician, then z is reading a book. Therefore there is at least one x for which z is an electrician if and only if z will work.
forall x: P(x) -> Q(x). forall x: R(x) -> S(x). exists x: S(x) -> P(x). forall x: Q(x) -> R(x). Therefore exists x: Q(x) <-> S(x).