Only two of these four statements are true! A converse statement is gotten by exchanging the positions of 'p' and 'q' in the given condition. Proof Warning 2.3. If you win the race then you will get a prize. B If n > 2, then n 2 > 4. Here 'p' is the hypothesis and 'q' is the conclusion. Graphical expression tree Let x be a real number. Still wondering if CalcWorkshop is right for you? Corollary \(\PageIndex{1}\): Modus Tollens for Inverse and Converse. Notice that by using contraposition, we could use one of our basic definitions, namely the definition of even integers, to help us prove our claim, which, once again, made our job so much easier. Hypothesis exists in theif clause, whereas the conclusion exists in the then clause. }\) The contrapositive of this new conditional is \(\neg \neg q \rightarrow \neg \neg p\text{,}\) which is equivalent to \(q \rightarrow p\) by double negation. If two angles are not congruent, then they do not have the same measure. The conditional statement given is "If you win the race then you will get a prize.". Unicode characters "", "", "", "" and "" require JavaScript to be They are related sentences because they are all based on the original conditional statement. Simplify the boolean expression $$$\overline{\left(\overline{A} + B\right) \cdot \left(\overline{B} + C\right)}$$$. Elementary Foundations: An Introduction to Topics in Discrete Mathematics (Sylvestre), { "2.01:_Equivalence" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "2.02:_Propositional_Calculus" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "2.03:_Converse_Inverse_and_Contrapositive" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "2.04:_Activities" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "2.05:_Exercises" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()" }, { "00:_Front_Matter" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "01:_Symbolic_language" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "02:_Logical_equivalence" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "03:_Boolean_algebra" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "04:_Predicate_logic" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "05:_Arguments" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "06:_Definitions_and_proof_methods" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "07:_Proof_by_mathematical_induction" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "08:_Axiomatic_systems" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "09:_Sets" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "10:_Functions" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "11:_Recurrence_and_induction" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "12:_Cardinality" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "13:_Countable_and_uncountable_sets" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "14:_Graphs" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "15:_Paths_and_connectedness" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "16:_Trees_and_searches" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "17:_Relations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "18:_Equivalence_relations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "19:_Partially_ordered_sets" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "20:_Counting" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "21:_Permutations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "22:_Combinations" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "23:_Binomial_and_multinomial_coefficients" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()", "zz:_Back_Matter" : "property get [Map MindTouch.Deki.Logic.ExtensionProcessorQueryProvider+<>c__DisplayClass228_0.b__1]()" }, 2.3: Converse, Inverse, and Contrapositive, [ "article:topic", "showtoc:no", "license:gnufdl", "Modus tollens", "authorname:jsylvestre", "licenseversion:13", "source@https://sites.ualberta.ca/~jsylvest/books/EF/book-elementary-foundations.html" ], https://math.libretexts.org/@app/auth/3/login?returnto=https%3A%2F%2Fmath.libretexts.org%2FBookshelves%2FCombinatorics_and_Discrete_Mathematics%2FElementary_Foundations%253A_An_Introduction_to_Topics_in_Discrete_Mathematics_(Sylvestre)%2F02%253A_Logical_equivalence%2F2.03%253A_Converse_Inverse_and_Contrapositive, \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}}}\) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash{#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\), source@https://sites.ualberta.ca/~jsylvest/books/EF/book-elementary-foundations.html, status page at https://status.libretexts.org. Similarly, for all y in the domain of f^(-1), f(f^(-1)(y)) = y. If a quadrilateral has two pairs of parallel sides, then it is a rectangle. "If it rains, then they cancel school" Contrapositive Formula For a given conditional statement {\color{blue}p} \to {\color{red}q}, we can write the converse statement by interchanging or swapping the roles of the hypothesis and conclusion of the original conditional statement. (Examples #1-2), Express each statement using logical connectives and determine the truth of each implication (Examples #3-4), Finding the converse, inverse, and contrapositive (Example #5), Write the implication, converse, inverse and contrapositive (Example #6). Textual expression tree Negations are commonly denoted with a tilde ~. The contrapositive of "If it rains, then they cancel school" is "If they do not cancel school, then it does not rain." If the statement is true, then the contrapositive is also logically true. Polish notation Converse, Inverse, and Contrapositive. Here are some of the important findings regarding the table above: Introduction to Truth Tables, Statements, and Logical Connectives, Truth Tables of Five (5) Common Logical Connectives or Operators. For example, the contrapositive of "If it is raining then the grass is wet" is "If the grass is not wet then it is not raining." Note: As in the example, the contrapositive of any true proposition is also true. ", To form the inverse of the conditional statement, take the negation of both the hypothesis and the conclusion. A pattern of reaoning is a true assumption if it always lead to a true conclusion. The mini-lesson targetedthe fascinating concept of converse statement. From the given inverse statement, write down its conditional and contrapositive statements. If a quadrilateral is a rectangle, then it has two pairs of parallel sides. A proof by contrapositive would look like: Proof: We'll prove the contrapositive of this statement . We can also construct a truth table for contrapositive and converse statement. There are 3 methods for finding the inverse of a function: algebraic method, graphical method, and numerical method. You may use all other letters of the English ", Conditional statment is "If there is accomodation in the hotel, then we will go on a vacation." Therefore. Now I want to draw your attention to the critical word or in the claim above. Write a biconditional statement and determine the truth value (Example #7-8), Construct a truth table for each compound, conditional statement (Examples #9-12), Create a truth table for each (Examples #13-15). -Inverse of conditional statement. -Inverse statement, If I am not waking up late, then it is not a holiday. disjunction. Please note that the letters "W" and "F" denote the constant values Together, we will work through countless examples of proofs by contrapositive and contradiction, including showing that the square root of 2 is irrational! There can be three related logical statements for a conditional statement. Canonical CNF (CCNF) A rewording of the contrapositive given states the following: G has matching M' that is not a maximum matching of G iff there exists an M-augmenting path. Heres a BIG hint. ThoughtCo. I'm not sure what the question is, but I'll try to answer it. Contrapositive is used when an implication has many hypotheses or when the hypothesis specifies infinitely many objects. Warning \(\PageIndex{1}\): Common Mistakes, Example \(\PageIndex{1}\): Related Conditionals are not All Equivalent, Suppose \(m\) is a fixed but unspecified whole number that is greater than \(2\text{.}\). Conjunctive normal form (CNF) Mixing up a conditional and its converse. whenever you are given an or statement, you will always use proof by contraposition. Again, just because it did not rain does not mean that the sidewalk is not wet. This video is part of a Discrete Math course taught at the University of Cinc. We say that these two statements are logically equivalent. Not to G then not w So if calculator. paradox? What is also important are statements that are related to the original conditional statement by changing the position of P, Q and the negation of a statement. Whats the difference between a direct proof and an indirect proof? If \(m\) is a prime number, then it is an odd number. Apply this result to show that 42 is irrational, using the assumption that 2 is irrational. In other words, to find the contrapositive, we first find the inverse of the given conditional statement then swap the roles of the hypothesis and conclusion. Solution. The assertion A B is true when A is true (or B is true), but it is false when A and B are both false. Contradiction? The converse of the above statement is: If a number is a multiple of 4, then the number is a multiple of 8. Example: Consider the following conditional statement. To calculate the inverse of a function, swap the x and y variables then solve for y in terms of x. You can find out more about our use, change your default settings, and withdraw your consent at any time with effect for the future by visiting Cookies Settings, which can also be found in the footer of the site. Thus, we can relate the contrapositive, converse and inverse statements in such a way that the contrapositive is the inverse of a converse statement. 1. The sidewalk could be wet for other reasons. The original statement is the one you want to prove. The statement The right triangle is equilateral has negation The right triangle is not equilateral. The negation of 10 is an even number is the statement 10 is not an even number. Of course, for this last example, we could use the definition of an odd number and instead say that 10 is an odd number. We note that the truth of a statement is the opposite of that of the negation. Contrapositive. Before we define the converse, contrapositive, and inverse of a conditional statement, we need to examine the topic of negation. Apply de Morgan's theorem $$$\overline{X \cdot Y} = \overline{X} + \overline{Y}$$$ with $$$X = \overline{A} + B$$$ and $$$Y = \overline{B} + C$$$: Apply de Morgan's theorem $$$\overline{X + Y} = \overline{X} \cdot \overline{Y}$$$ with $$$X = \overline{A}$$$ and $$$Y = B$$$: Apply the double negation (involution) law $$$\overline{\overline{X}} = X$$$ with $$$X = A$$$: Apply de Morgan's theorem $$$\overline{X + Y} = \overline{X} \cdot \overline{Y}$$$ with $$$X = \overline{B}$$$ and $$$Y = C$$$: Apply the double negation (involution) law $$$\overline{\overline{X}} = X$$$ with $$$X = B$$$: $$$\overline{\left(\overline{A} + B\right) \cdot \left(\overline{B} + C\right)} = \left(A \cdot \overline{B}\right) + \left(B \cdot \overline{C}\right)$$$.