(************************************************************************)
(*         *   The Coq Proof Assistant / The Coq Development Team       *)
(*  v      *   INRIA, CNRS and contributors - Copyright 1999-2018       *)
(* <O___,, *       (see CREDITS file for the list of authors)           *)
(*   \VV/  **************************************************************)
(*    //   *    This file is distributed under the terms of the         *)
(*         *     GNU Lesser General Public License Version 2.1          *)
(*         *     (see LICENSE file for the text of the license)         *)
(************************************************************************)
(** Properties of addition.  This file is mostly OBSOLETE now, see module [PeanoNat.Nat] instead.  [Nat.add] is defined in [Init/Nat.v] as: << Fixpoint add (n m:nat) : nat := match n with | O => m | S p => S (p + m) end where "n + m" := (add n m) : nat_scope. >> *)
Local Open Scope nat_scope.
(** * Neutrality of 0, commutativity, associativity *)
Notation plus_0_l := Nat.add_0_l (only parsing).
Notation plus_0_r := Nat.add_0_r (only parsing).
Notation plus_comm := Nat.add_comm (only parsing).
Notation plus_assoc := Nat.add_assoc (only parsing).
Notation plus_permute := Nat.add_shuffle3 (only parsing).
Definition plus_Snm_nSm : forall n m, S n + m = n + S m :=
Peano.plus_n_Sm.
(** * Simplification *)
(** * Compatibility with order *)
(** * Inversion lemmas *)
Definition plus_is_one m n :
m + n = 1 -> {m = 0 /\ n = 1} + {m = 1 /\ n = 0}.
(** * Discrimination *)

Lemma succ_plus_discr n m : n <> S (m+n).