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: R(y) or ~Q(y). exists y: S(y) -> Q(y). forall y: S(y) <-> R(y).
forall y: Q(y) -> R(y) can be inferred via the universal rewriting rule. forall y: S(y) -> R(y) can be inferred via the universal biconditional elimination rule. forall y: R(y) -> S(y) can be inferred via the universal biconditional elimination rule.