Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Require Import Classical. | |
(* | |
¬(P ∧ Q) ⇔ (¬P ∨ ¬Q) | |
*) | |
Theorem demorgan_1: forall P Q : Prop, ~(P /\ Q) <-> (~P \/ ~Q). | |
Proof. intros p q. unfold iff. split. | |
- intros H. apply not_and_or in H. assumption. | |
- intros H. apply or_not_and in H. assumption. Qed. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Require Import Classical. | |
(* | |
¬(P ∧ Q) ⇔ (¬P ∨ ¬Q) | |
*) | |
Theorem demorgan_1: forall P Q : Prop, ~(P /\ Q) <-> (~P \/ ~Q). | |
Proof. intros p q. unfold iff. split. | |
- intros H. apply not_and_or in H. assumption. | |
- intros H. apply or_not_and in H. assumption. Qed. |
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.