aboutsummaryrefslogtreecommitdiffhomepage
path: root/test-suite/success/setoid_test.v
diff options
context:
space:
mode:
authorGravatar sacerdot <sacerdot@85f007b7-540e-0410-9357-904b9bb8a0f7>2004-09-03 10:53:43 +0000
committerGravatar sacerdot <sacerdot@85f007b7-540e-0410-9357-904b9bb8a0f7>2004-09-03 10:53:43 +0000
commit362a2f4adf4f53ac264ffb3c5bfbf2852be846ca (patch)
treeecb181c9f22780229730c306f632f18c1045cf94 /test-suite/success/setoid_test.v
parentc5b5c7af26affa3ecc1713bf9dddb6167b84a942 (diff)
* setoid_test.v removed and added again in new syntax
* setoid_test.v8 ported to the new implementation of setoid_*. git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@6051 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'test-suite/success/setoid_test.v')
-rw-r--r--test-suite/success/setoid_test.v104
1 files changed, 0 insertions, 104 deletions
diff --git a/test-suite/success/setoid_test.v b/test-suite/success/setoid_test.v
deleted file mode 100644
index 2d2b2af89..000000000
--- a/test-suite/success/setoid_test.v
+++ /dev/null
@@ -1,104 +0,0 @@
-Require Setoid.
-
-Parameter A : Set.
-
-Axiom eq_dec : (a,b :A) {a=b}+{~a=b}.
-
-Inductive set : Set :=
-|Empty : set
-|Add : A -> set -> set.
-
-Fixpoint In [a:A; s:set] : Prop :=
-Cases s of
-|Empty => False
-|(Add b s') => a=b \/ (In a s')
-end.
-
-Definition same [s,t:set] : Prop :=
-(a:A) (In a s) <-> (In a t).
-
-Lemma setoid_set : (Setoid_Theory set same).
-
-Unfold same; Split.
-Red; Auto.
-
-Red.
-Intros.
-Elim (H a); Auto.
-
-Intros.
-Elim (H a); Elim (H0 a).
-Split; Auto.
-Save.
-
-Add Setoid set same setoid_set.
-
-Add Morphism In : In_ext.
-Unfold same; Intros a s t H; Elim (H a); Auto.
-Save.
-
-Lemma add_aux : (s,t:set) (same s t) ->
- (a,b:A)(In a (Add b s)) -> (In a (Add b t)).
-Unfold same; Induction 2; Intros.
-Rewrite H1.
-Simpl; Left; Reflexivity.
-
-Elim (H a).
-Intros.
-Simpl; Right.
-Apply (H2 H1).
-Save.
-
-Add Morphism Add : Add_ext.
-Split; Apply add_aux.
-Assumption.
-
-Rewrite H.
-Apply Seq_refl.
-Exact setoid_set.
-Save.
-
-Fixpoint remove [a:A; s:set] : set :=
-Cases s of
-|Empty => Empty
-|(Add b t) => Cases (eq_dec a b) of
- |(left _) => (remove a t)
- |(right _) => (Add b (remove a t))
- end
-end.
-
-Lemma in_rem_not : (a:A)(s:set) ~(In a (remove a (Add a Empty))).
-
-Intros.
-Setoid_replace (remove a (Add a Empty)) with Empty.
-Unfold same.
-Split.
-Simpl.
-Intro H; Elim H.
-
-Simpl.
-Case (eq_dec a a).
-Intros e ff; Elim ff.
-
-Intros; Absurd a=a; Trivial.
-
-Auto.
-Save.
-
-Parameter P :set -> Prop.
-Parameter P_ext : (s,t:set) (same s t) -> (P s) -> (P t).
-
-Add Morphism P : P_extt.
-Exact P_ext.
-Save.
-
-Lemma test_rewrite : (a:A)(s,t:set)(same s t) -> (P (Add a s)) -> (P (Add a t)).
-Intros.
-Rewrite <- H.
-Rewrite H.
-Setoid_rewrite <- H.
-Setoid_rewrite H.
-Setoid_rewrite <- H.
-Trivial.
-Save.
-