Translate the following inference to logic notation: If Richard were bored, then Richard is happy. For all x, x_11 is bored if and only if x_11 is happy. Richard is not bored. Therefore Richard is not happy.
P(a) -> Q(a). forall x: P(x) <-> Q(x). ~P(a). Therefore ~Q(a).