diff options
| author |  Enrico Tassi <gareuselesinge@debian.org> | 2016-12-27 16:53:30 +0100 |
|---|---|---|
| committer | Enrico Tassi <gareuselesinge@debian.org> | 2016-12-27 18:33:25 +0100 |
| commit | 1b92c226e563643da187b8614d5888dc4855eb43 (patch) | |
| tree | c4c3d204b36468b58cb71050ba95f06b8dd7bc2e /theories/Sorting | |
| parent | 7c9b0a702976078b813e6493c1284af62a3f093c (diff) | |
Imported Upstream version 8.6
Diffstat (limited to 'theories/Sorting')
| -rw-r--r-- | theories/Sorting/Permutation.v | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/theories/Sorting/Permutation.v b/theories/Sorting/Permutation.v index e159efa8..44f8ff6a 100644 --- a/theories/Sorting/Permutation.v +++ b/theories/Sorting/Permutation.v @@ -318,10 +318,10 @@ Lemma Permutation_length_2_inv : Proof. intros a1 a2 l H; remember [a1;a2] as m in H. revert a1 a2 Heqm. - induction H; intros; try (injection Heqm; intros; subst; clear Heqm); + induction H; intros; try (injection Heqm as ? ?; subst); discriminate || (try tauto). apply Permutation_length_1_inv in H as ->; left; auto. - apply IHPermutation1 in Heqm as [H1|H1]; apply IHPermutation2 in H1 as (); + apply IHPermutation1 in Heqm as [H1|H1]; apply IHPermutation2 in H1 as []; auto. Qed. |