The rules of valid inference are a set of laws by which the syntax of statements in a system of logic, such as propositional or first-order logic, may be manipulated.
Rules of inference are, in themselves, simple valid argument forms. They may be divided into basic rules, which are fundamental to logic and cannot be eliminated without losing the ability to express some valid argument forms, and derived rules, which can be proven by the basic rules and serve as shortcuts for logicians when constructing a logical argument or proof.
There are, essentially, two basic rules for each basic logical operator of propositional logic (¬, ∧, ∨, →, and ↔)—one for introduction (I) of the operator and one for elimination (E) of the operator. In first-order logic, we add the quantifier rules (for ∀ and ∃). In modal logic, we add rules for the modal operators (□ and ◊)
The derived rules are the rules that can be inferred from the basic rules. All of the valid argument forms can be derived from the basic rules, but the term "rules" is normally used for those that are especially simple, and for those that are uncommon in normal spoken arguments but are rather used when formulating and proving the validity of arguments. The following is a list of common derived rules: