Mercurial > urweb

comparison src/coq/Axioms.v @ 616:d26d1f3acfd6

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Semantics for ordered rows only
author Adam Chlipala <adamc@hcoop.net>
date Wed, 18 Feb 2009 09:32:17 -0500
parents
children be88d2d169f6
comparison
equal deleted inserted replaced
615:3c77133afd9a 616:d26d1f3acfd6
1 (* Copyright (c) 2009, Adam Chlipala
2 * All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are met:
6 *
7 * - Redistributions of source code must retain the above copyright notice,
8 * this list of conditions and the following disclaimer.
9 * - Redistributions in binary form must reproduce the above copyright notice,
10 * this list of conditions and the following disclaimer in the documentation
11 * and/or other materials provided with the distribution.
12 * - The names of contributors may not be used to endorse or promote products
13 * derived from this software without specific prior written permission.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
19 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
20 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
21 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
22 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
24 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
25 * POSSIBILITY OF SUCH DAMAGE.
26 *)
27
28 Require Import Syntax.
29
30 Set Implicit Arguments.
31
32
33 Axiom ext_eq : forall dom ran (f g : forall x : dom, ran x),
34 (forall x, f x = g x)
35 -> f = g.
36
37 Theorem ext_eq_forall : forall dom (f g : forall x : dom, Type),
38 (forall x, f x = g x)
39 -> (forall x, f x) = (forall x, g x).
40 intros.
41 rewrite (ext_eq _ f g H); reflexivity.
42 Qed.
43
44 Theorem ext_eq_forallS : forall dom (f g : forall x : dom, Set),
45 (forall x, f x = g x)
46 -> (forall x, f x) = (forall x, g x).
47 intros.
48 rewrite (ext_eq _ f g H); reflexivity.
49 Qed.