aboutsummaryrefslogtreecommitdiff
path: root/theories/Sorting
diff options
context:
space:
mode:
authorOlivier Laurent2020-04-19 10:53:28 +0200
committerOlivier Laurent2020-04-19 11:23:44 +0200
commit160ac52f520c5d77cde8fc5734839de54995e165 (patch)
tree441742b779283049106796c531a342d27a04425a /theories/Sorting
parentf3af9a4c6e6813f32dfe632209e145ffbf5fed98 (diff)
remove useless hypothesis in NoDup_Permutation_bis
(thanks to new NoDup_incl_NoDup)
Diffstat (limited to 'theories/Sorting')
-rw-r--r--theories/Sorting/Permutation.v6
1 files changed, 4 insertions, 2 deletions
diff --git a/theories/Sorting/Permutation.v b/theories/Sorting/Permutation.v
index 86eebc6b4f..ffef8a216d 100644
--- a/theories/Sorting/Permutation.v
+++ b/theories/Sorting/Permutation.v
@@ -499,11 +499,13 @@ Proof.
rewrite (NoDup_Add AD) in Hl'. tauto.
Qed.
-Lemma NoDup_Permutation_bis l l' : NoDup l -> NoDup l' ->
+Lemma NoDup_Permutation_bis l l' : NoDup l ->
length l' <= length l -> incl l l' -> Permutation l l'.
Proof.
intros. apply NoDup_Permutation; auto.
- split; auto. apply NoDup_length_incl; trivial.
+ - now apply NoDup_incl_NoDup with l.
+ - split; auto.
+ apply NoDup_length_incl; trivial.
Qed.
Lemma Permutation_NoDup l l' : Permutation l l' -> NoDup l -> NoDup l'.