Negation introduction

From testwiki
Revision as of 05:00, 29 October 2023 by 61.99.5.49 (talk) (Proof)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Infobox mathematical statement Template:Transformation rules

Negation introduction is a rule of inference, or transformation rule, in the field of propositional calculus.

Negation introduction states that if a given antecedent implies both the consequent and its complement, then the antecedent is a contradiction.[1][2]

Formal notation

This can be written as: (PQ)(P¬Q)¬P

An example of its use would be an attempt to prove two contradictory statements from a single fact. For example, if a person were to state "Whenever I hear the phone ringing I am happy" and then state "Whenever I hear the phone ringing I am not happy", one can infer that the person never hears the phone ringing.

Many proofs by contradiction use negation introduction as reasoning scheme: to prove ¬P, assume for contradiction P, then derive from it two contradictory inferences Q and ¬Q. Since the latter contradiction renders P impossible, ¬P must hold.

Proof

Step Proposition Derivation
1 (PQ)(P¬Q) Given
2 (¬PQ)(¬P¬Q) Material implication
3 ¬P(Q¬Q) Distributivity
4 ¬PF Law of noncontradiction
5 ¬P Disjunctive syllogism (3,4)

See also

References

Template:Reflist