aboutsummaryrefslogtreecommitdiffhomepage
path: root/theories/Sorting
diff options
context:
space:
mode:
Diffstat (limited to 'theories/Sorting')
-rw-r--r--theories/Sorting/Permutation.v9
1 files changed, 4 insertions, 5 deletions
diff --git a/theories/Sorting/Permutation.v b/theories/Sorting/Permutation.v
index da30d096c..c3cd4f4a8 100644
--- a/theories/Sorting/Permutation.v
+++ b/theories/Sorting/Permutation.v
@@ -75,11 +75,10 @@ Hint Resolve Permutation_refl Permutation_sym Permutation_trans.
(* This provides reflexivity, symmetry and transitivity and rewriting
on morphims to come *)
-Add Parametric Relation A : (list A) (@Permutation A)
- reflexivity proved by (@Permutation_refl A)
- symmetry proved by (@Permutation_sym A)
- transitivity proved by (@Permutation_trans A)
-as Permutation_Equivalence.
+Instance Permutation_Equivalence A : Equivalence (@Permutation A) | 10 := {
+ Equivalence_Reflexive := @Permutation_refl A ;
+ Equivalence_Symmetric := @Permutation_sym A ;
+ Equivalence_Transitive := @Permutation_trans A }.
Add Parametric Morphism A (a:A) : (cons a)
with signature @Permutation A ==> @Permutation A