Translate the following inference to logic notation: For all x, x_10 will play tennis. For all x, x_10 is a janitor. For all x, if x_10 plays tennis, then x_10 is sleeping. For all x, if x_10 sleeps, then x_10 is cooking. For all x, x_10 will climb a mountain. Therefore for all x, x_10 will climb a mountain and x_10 will cook.
forall x: P(x). forall x: Q(x). forall x: P(x) -> R(x). forall x: R(x) -> S(x). forall x: T(x). Therefore forall x: T(x) and S(x).