diff options
| author |  herbelin <herbelin@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2013-06-02 21:42:11 +0000 |
|---|---|---|
| committer | herbelin <herbelin@85f007b7-540e-0410-9357-904b9bb8a0f7> | 2013-06-02 21:42:11 +0000 |
| commit | d51d98682fcff981a1e6b95574c25fc7edf97b3f (patch) | |
| tree | 0f6e2a769b3ebf4a93d103f0c5d3ae9acabd8281 /theories/Sorting | |
| parent | 52ca74d1495249844e2ba1be2eaec662e3808074 (diff) | |
Making the behavior of "injection ... as ..." more natural:
- hypotheses are introduced in the left-to-right order
- intropatterns have to match the number of generated hypotheses, and,
if less, new introduction names are automatically generated
- clearing the hypothesis on which injection is applied, if any.
However, this is a source of incompatibilities (for a variant of
injection that is hopefully not used a lot). Compatibility can be
restored by "Unset Injection L2R Pattern Order".
git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@16556 85f007b7-540e-0410-9357-904b9bb8a0f7
Diffstat (limited to 'theories/Sorting')
| -rw-r--r-- | theories/Sorting/Permutation.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/Sorting/Permutation.v b/theories/Sorting/Permutation.v index 65bf17ef0..cf9f8ee42 100644 --- a/theories/Sorting/Permutation.v +++ b/theories/Sorting/Permutation.v @@ -313,7 +313,7 @@ Qed. Lemma Permutation_length_1_inv: forall a l, Permutation [a] l -> l = [a]. Proof. intros a l H; remember [a] as m in H. - induction H; try (injection Heqm as -> ->; clear Heqm); + induction H; try (injection Heqm as -> ->); discriminate || auto. apply Permutation_nil in H as ->; trivial. Qed. |