Consider the following premises. forall x_9: P_9(x_9) or ~U(x_9). forall x_9: R(x_9) -> U(x_9). forall x_9: P_9(x_9) -> R(x_9). Can we infer R(a) -> U(a) from them?
 From forall x_9: P_9(x_9) or ~U(x_9) we can infer forall x_9: U(x_9) -> P_9(x_9). From forall x_9: U(x_9) -> P_9(x_9), forall x_9: P_9(x_9) -> R(x_9) we can infer forall x_9: U(x_9) -> R(x_9). From forall x_9: U(x_9) -> R(x_9), forall x_9: R(x_9) -> U(x_9) we can infer forall x_9: U(x_9) <-> R(x_9). From forall x_9: U(x_9) <-> R(x_9) we can infer U(a) <-> R(a). Finally, from U(a) <-> R(a) we can infer R(a) -> U(a). Therefore, the answer is yes.