(* This code is copyrighted by its authors; it is distributed under  *)
(* the terms of the LGPL license (see LICENSE and description files) *)
(* Contribution to the Coq Library   V6.3 (July 1999)                    *)
(****************************************************************************)
(*                                                                          *)
(*                                                                          *)
(*                   Solange Coupet-Grimal & Line Jakubiec                  *)
(*                                                                          *)
(*                                                                          *)
(*              Laboratoire d'Informatique de Marseille                     *)
(*               CMI-Technopole de Chateau-Gombert                          *)
(*                   39, Rue F. Joliot Curie                                *)
(*                   13453 MARSEILLE Cedex 13                               *)
(*           e-mail:{Solange.Coupet,Line.Jakubiec}@lim.univ-mrs.fr          *)
(*                                                                          *)
(*                                                                          *)
(*                                Coq V5.10                                 *)
(*                              May 30th 1996                               *)
(*                                                                          *)
(****************************************************************************)
(*                               Lib_Plus.v                                 *)
(****************************************************************************)
Require Export Lib_Minus.
intros n m; elim (plus_comm m n); apply minus_plus.
Qed.
Hint Resolve plus_opp.
intro; elim plus_comm; auto with arith.
Qed.
Hint Resolve S_plus.
simple induction n; simple induction m; auto with arith.
intros.
simpl in |- *; apply lt_n_S.
auto with arith.
Qed.
Hint Resolve lt_plus.

Lemma le_minus_plus : forall n m : nat, n - m <= n + m.