diff options
author | letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2012-05-18 10:50:45 +0000 |
---|---|---|
committer | letouzey <letouzey@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2012-05-18 10:50:45 +0000 |
commit | 7511435a39d70625cde2949ddcc70684525a87e9 (patch) | |
tree | c3185b76e29a97f16f5ef8994d23260aa6c4e625 /theories/Sorting/PermutEq.v | |
parent | daaa55887114dc1f3c66b459add77bf9394d307b (diff) |
List + Permutation : more results about nth_error and nth
In particular, characterisation of NoDup and Permutation
in term of nth_error and nth
Some of these results have been suggested last year by Bas Spitters
(cf. MathClasses).
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@15336 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Sorting/PermutEq.v')
-rw-r--r-- | theories/Sorting/PermutEq.v | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/theories/Sorting/PermutEq.v b/theories/Sorting/PermutEq.v index d4e5fba4c..758311955 100644 --- a/theories/Sorting/PermutEq.v +++ b/theories/Sorting/PermutEq.v @@ -12,8 +12,8 @@ Set Implicit Arguments. (** This file is similar to [PermutSetoid], except that the equality used here is Coq usual one instead of a setoid equality. In particular, we can then - prove the equivalence between [List.Permutation] and - [Permutation.permutation]. + prove the equivalence between [Permutation.Permutation] and + [PermutSetoid.permutation]. *) Section Perm. |