diff options
| author |  Hugo Herbelin <Hugo.Herbelin@inria.fr> | 2014-06-03 17:15:40 +0200 |
|---|---|---|
| committer | Hugo Herbelin <Hugo.Herbelin@inria.fr> | 2014-06-04 18:42:22 +0200 |
| commit | e1e0f4f7f3c549fd3d5677b67c6b13ed687e6f12 (patch) | |
| tree | 70d40db0a8bb6378bb97d9c7c72567045bd4bd78 /theories/Sorting | |
| parent | 6c9e2ded8fc093e42902d008a883b6650533d47f (diff) | |
Make standard library independent of the names generated by
induction/elim over a dependent elimination principle for Prop
arguments.
Diffstat (limited to 'theories/Sorting')
| -rw-r--r-- | theories/Sorting/Heap.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/Sorting/Heap.v b/theories/Sorting/Heap.v index ce2722fd6..9d75d09ae 100644 --- a/theories/Sorting/Heap.v +++ b/theories/Sorting/Heap.v @@ -152,7 +152,7 @@ Section defs. revert l2 H0. fix 1. intros. destruct l2 as [|a0 l0]. apply merge_exist with (a :: l); simpl; auto with datatypes. - elim (leA_dec a a0); intros. + induction (leA_dec a a0) as [Hle|Hle]. (* 1 (leA a a0) *) apply Sorted_inv in H. destruct H. |