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 y: P(y) -> R(y). forall y: P(y) or T_1(y). forall y: R(y) -> P(y). forall y: R(y) or ~T_1(y).
forall y: T_1(y) -> R(y) can be inferred via the universal rewriting rule. forall y: P(y) <-> R(y) can be inferred via the universal biconditional introduction rule. forall y: R(y) <-> P(y) can be inferred via the universal biconditional introduction rule.