Section RelElim.
Variable R : relation N.t.
Hypothesis R_wd : Proper (N.eq==>N.eq==>iff) R.
End RelElim.
(** Predecessor and order *)
(* Converse is false for n == m == 0 *)
(* Converse is false for n == m == 0 *)

Theorem le_pred_le : forall n m, n <= P m -> n <= m.