Translate the following inference to logic notation: For all x, x_4 will climb a mountain if and only if x_4 will sleep. For all x, if x_4 sleeps, then x_4 is playing tennis. For all x, if x_4 plays tennis, then x_4 is sleeping. For all x, x_4 will not climb a mountain. Therefore for all x, x_4 will not play tennis.
forall x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> Q(x). forall x: ~P(x). Therefore forall x: ~R(x).