Created
July 6, 2018 02:20
-
-
Save donovancrichton/6f7ec8fb572ece8f6370a7108c807521 to your computer and use it in GitHub Desktop.
Proof by Simplification from Logical Foundations
This file contains hidden or 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
| Theorem plus_id_example : ∀ n m:nat, | |
| n = m → | |
| n + n = m + m. | |
| Proof. | |
| (* move both quantifiers into the context: *) | |
| intros n m. | |
| (* move the hypothesis into the context: *) | |
| intros H. | |
| (* rewrite the goal using the hypothesis: *) | |
| rewrite → H. | |
| reflexivity. Qed. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment