Created
October 3, 2011 13:53
-
-
Save gclaramunt/1259144 to your computer and use it in GitHub Desktop.
Trivial proof
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 AE: forall k:U,A(k)->(exists x:U,A(x)). | |
Proof. | |
intros k Ha; exists k; apply Ha. | |
Qed. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment