◀ ▲ ▶Branches / Logic / Lemma: Negation of an Implication
Another important lemma is the way how to negate an implication.
Lemma: Negation of an Implication
The negation of an implication $x\Rightarrow y$ is equivalent to the conjunction of the antecedent $x$ and the negated consequent $\neg y$, formally $$\neg (x\Rightarrow y)\Longleftrightarrow (x \wedge \neg y).$$
Table of Contents
Proofs: 1 Examples: 1
Mentioned in:
Examples: 1
Explanations: 2
Thank you to the contributors under CC BY-SA 4.0!

- Github:
-

References
Bibliography
- Mendelson Elliott: "Theory and Problems of Boolean Algebra and Switching Circuits", McGraw-Hill Book Company, 1982