What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? Name the inference rule being used: forall x: P(x) <-> T(x). forall x: R(x) or ~U(x). forall x: P(x) -> U(x).
forall x: U(x) -> R(x) can be inferred via the universal rewriting rule. forall x: P(x) -> T(x) can be inferred via the universal biconditional elimination rule. forall x: T(x) -> P(x) can be inferred via the universal biconditional elimination rule.