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