Translate the following inference to logic notation: If Richard climbs a mountain, then Richard is making tea. For all x, x_9 will climb a mountain if and only if x_9 will make tea. Therefore if Richard makes tea, then Richard is climbing a mountain.
P(a) -> Q(a). forall x: P(x) <-> Q(x). Therefore Q(a) -> P(a).