From ac952fc310b1ba17c8e5a243ec617351130e1d81 Mon Sep 17 00:00:00 2001 From: herbelin Date: Mon, 1 Dec 2003 13:36:45 +0000 Subject: Meilleure robustesse des reordonnement d'arguments (3eme) git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@5050 85f007b7-540e-0410-9357-904b9bb8a0f7 --- theories7/Arith/Plus.v | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/theories7/Arith/Plus.v b/theories7/Arith/Plus.v index f6ea71de74..a00cde3969 100755 --- a/theories7/Arith/Plus.v +++ b/theories7/Arith/Plus.v @@ -83,7 +83,7 @@ Notation "'simpl_plus_l' c a b" := (plus_reg_l a b c) Notation simpl_plus_l := plus_reg_l. ]. -Lemma plus_le_reg_l : (n,m,p:nat) (p+n)<=(p+m) -> n<=m. +Lemma plus_le_reg_l : (n,m,p:nat)((p+n)<=(p+m))->(n<=m). Proof. NewInduction p; Simpl; Auto with arith. Qed. @@ -95,7 +95,7 @@ Notation "'simpl_le_plus_l' c a" := [b:nat](plus_le_reg_l a b c) (at level 10, a, c at next level). Notation "'simpl_le_plus_l' c a b" := (plus_le_reg_l a b c) (at level 10, a, b, c at next level). -Notation simpl_le_plus_l := plus_reg_l. +Notation simpl_le_plus_l := plus_le_reg_l. ]. Lemma simpl_lt_plus_l : (n,m,p:nat) (p+n)<(p+m) -> n