Law of Contrapositive Examples

When it rains, the grass is wet. The counter-positive of this statement is: If the grass is not wet, it does not rain. „If q then p” is a counterpositive of the conditional statement „if p then q”. For example, the counterpositive of „if A then B” is „if non-B then non-A”. The counterpositive of a conditional statement is a combination of inverse and inverse. The counterpositive of a conditional statement is a combination of inverse and inverse. This indicates that „if P {displaystyle P}, then Q {displaystyle Q}”, or „if Socrates is a human, then Socrates is a human”. In such a condition, P {displaystyle P} is the predecessor and Q {displaystyle Q} is the result. A statement is the counter-positive of others only if its predecessor is the denied consequence of others and vice versa. Thus, a contrapositive usually takes the form of: In other words, the contrapositive is logically equivalent to a given conditional statement, although it is not sufficient for a biconditional statement. By resetting R and S to P {displaystyle P} and Q {displaystyle Q}, we get the desired counterpositive: the conditional statement P → Q {displaystyle Prightarrow Q}. In formulas: The counterpositive of P → Q {displaystyle Prightarrow Q} is ¬ Q → ¬ P {displaystyle neg Qrightarrow neg P}. [1] which can be assimilated to its counter-positive as follows: Since the counterpositive of a statement always has the same truth value (truth or lie) as the statement itself, it can be a powerful tool for proving mathematical theorems (especially if the truth of the counterpositive is easier to establish than the truth of the statement itself).

Contraposition (contractual) evidence is direct evidence of the counter-positive of a statement. [5] However, indirect methods such as contradictory proof can also be used with contraposition, such as proof of the irrationality of the square root of 2. By defining a rational number, we can assert that „If 2 {displaystyle {sqrt {2}}} is rational, then it can be expressed as an irreducible fraction”. This statement is true because it is a reformulation of a definition. The counterpositive of this statement is: „If 2 {displaystyle {sqrt {2}}} cannot be expressed as an irreducible fraction, then it is not rational.” This counter-positive, like the original statement, is also true. So, if it can be proved that 2 {displaystyle {sqrt {2}}} cannot be expressed as an irreducible fraction, then it must be the case that 2 {displaystyle {sqrt {2}}} is not a rational number. The latter can be proved by contradiction. If we combine the two proven statements, we obtain the desired logical equivalence between a conditional and its contrapositive: if the conditional statement is true, then the contrapositive is also logically true.

If the opposite is true, then the reverse is also logically true. Note that if P → Q {displaystyle Prightarrow Q} is true and one is given that Q {displaystyle Q} is false (i.e. ¬ Q {displaystyle neg Q} ), then one can logically conclude that P {displaystyle P} must also be false (i.e. ¬ P {displaystyle neg P} ). This is often referred to as the law of the contrapositive or the rule of inference modus tollens. [3] If the condition of a statement is p q, one can assemble the counterpositive statement by exchanging the hypothesis and the conclusion of the inverses of the same conditional statement. The counterpositive of p q is q p. is the counterpositive of the above statement. So you can say: if I`m standing in Manchester, I`m standing in the UK.

The positive counterpart to this statement is that if I do not show up in the UK, I will not show up in Manchester. The previous example used the counterpositive of a definition to prove a theorem. A theorem can also be proved by proving the counterpositive of the statement of the theorem. To prove that if a positive integer N is a non-square, its square root is irrational, we can prove its counterpositive equivalent that if a positive integer N has a rational square root, then N is a square number. This can be proved by putting √N equal to the rational expression a/b, where a and b are positive integers with no common prime factor, and quadraturing at N = a2/b2 and finding that since N is a positive integer b = 1, such that N = a2, is a square number. The conditional statement and its counter-positive are logically equivalent. The contrapositive ( ¬ Q → ¬ P {displaystyle neg Qrightarrow neg P} ) can be compared to three other statements: The law of contraposition states that a conditional statement is true if and only if its contrapositive is true. [2] In logic and mathematics, contraposition refers to the conclusion of moving from a conditional statement to its logically equivalent counterpositive and an associated method of proof known as contraposition proof.

The counter-positive of a statement has its precursor and therefore reverses and vice versa. The logical equivalence between two sentences means that together they are true or false together. To prove that counterpositives are logically equivalent, we need to understand when the material implication is true or false. In general, for any statement where A implies B, B does not always mean A. Therefore, the proof or refutation of one of these claims automatically proves or refutes the other, since they are logically equivalent to each other. This is false only if P {displaystyle P} is true and Q {displaystyle Q} is false. Therefore, we can reduce this sentence to the statement „False when P {displaystyle P} and not- Q {displaystyle Q}” (i.e. „True if it is not the case that P {displaystyle P} and not- Q {displaystyle Q} „): A Q sentence is implicit by a P sentence if the following relation is valid:. To form the inverse of the conditional statement, exchange the hypothesis and conclusion.

Take the statement „All red objects have color.” This can be expressed equivalently as „If an object is red, then it has color.” In first-order logic, the condition is defined as follows: Strictly speaking, a counterposition can only exist under two simple conditions. However, a counterposition can also exist under two complex and universal conditions if they are similar. Thus, ∀ x ( P x → Q x ) {displaystyle forall {x}(P{x}to Q{x})} , or „All P {displaystyle P} s are Q {displaystyle Q} s” is contracted to ∀ x ( ¬ Q x → ¬ P x ) {displaystyle forall {x}(neg Q{x}to neg P{x})} , or „All non- Q {displaystyle Q} s are non- P {displaystyle P} s.” [4] The contraposition represents an instance of Bayes` theorem, which can be expressed in a specific form such as: It is given that if A is true, B is true, and it is also given that B is not true.