diff options
| author | Théo Zimmermann | 2019-12-02 07:42:31 +0100 |
|---|---|---|
| committer | Théo Zimmermann | 2019-12-02 07:42:31 +0100 |
| commit | 31e109671896ef42653b1fcf239d8ebe1424c3da (patch) | |
| tree | 8ce9d6865ca970e5675fb90b452edb735cdf8b14 /plugins/btauto | |
| parent | 73f329333c6123a512ca975da949bec3778ce151 (diff) | |
| parent | a394876327dbe8af8410e8e91c01a363fd2d4cdf (diff) | |
Merge PR #10575: Clean up deprecations
Reviewed-by: Zimmi48
Reviewed-by: silene
Diffstat (limited to 'plugins/btauto')
| -rw-r--r-- | plugins/btauto/Algebra.v | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/plugins/btauto/Algebra.v b/plugins/btauto/Algebra.v index b90e44eed8..4a603f2c52 100644 --- a/plugins/btauto/Algebra.v +++ b/plugins/btauto/Algebra.v @@ -472,8 +472,8 @@ intros k i p H; induction H; simpl poly_mul_mon; case_decide; intuition. - match goal with [ H : null ?p |- _ ] => solve[inversion H] end. + apply (valid_le_compat k); auto; constructor; intuition. - assert (X := poly_mul_mon_null_compat); intuition eauto. - - cutrewrite <- (Pos.max (Pos.succ i) i0 = i0); intuition. - - cutrewrite <- (Pos.max (Pos.succ i) (Pos.succ i0) = Pos.succ i0); intuition. + - enough (Pos.max (Pos.succ i) i0 = i0) as <-; intuition. + - enough (Pos.max (Pos.succ i) (Pos.succ i0) = Pos.succ i0) as <-; intuition. Qed. Lemma poly_mul_valid_compat : forall kl kr pl pr, valid kl pl -> valid kr pr -> |