Translate the following inference to logic notation: For all x, x_6 will climb a mountain if and only if x_6 will make tea. For all x, if x_6 climbs a mountain, then x_6 is poor. For all x, if x_6 were poor, then x_6 is making tea. Therefore for all x, if x_6 climbs a mountain, then x_6 is making tea.
forall x: P(x) <-> Q(x). forall x: P(x) -> R(x). forall x: R(x) -> Q(x). Therefore forall x: P(x) -> Q(x).