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_4: ~P(x_4). forall x_4: P(x_4) <-> R_2(x_4). forall x_4: R_2(x_4) <-> Q(x_4). forall x_4: Q(x_4) or ~R_2(x_4).
forall x_4: R_2(x_4) -> Q(x_4) can be inferred via the universal rewriting rule. forall x_4: P(x_4) -> R_2(x_4) can be inferred via the universal biconditional elimination rule. forall x_4: R_2(x_4) -> Q(x_4) can be inferred via the universal biconditional elimination rule. forall x_4: R_2(x_4) -> P(x_4) can be inferred via the universal biconditional elimination rule. forall x_4: Q(x_4) -> R_2(x_4) can be inferred via the universal biconditional elimination rule. forall x_4: ~R_2(x_4) can be inferred via the universal biconditional elimination rule.