Translate the following inference to logic notation: For all x, if y_3 works, then y_3 is driving a car. For all x, if x_13 were an artist, then y_3 is working. For all x, x_13 will climb a mountain or x_13 is an artist. For all x, x_13 will climb a mountain if and only if y_3 will work. Therefore Joseph is driving a car.
forall x: P(x) -> Q(x). forall x: R(x) -> P(x). forall x: S(x) or R(x). forall x: S(x) <-> P(x). Therefore Q(a).