*)
(* Version 3: USE THIS IF YOU WANT TO "Compute" in Coq until bug #2608 is fixed. *)
Module Ident <: OrderedTypeFull
with Definition t := positive
with Definition lt := Plt
with Definition compare := fun x y => Pcompare x y Eq
with Definition le := Ple.
Definition t := positive.
Definition eq : t -> t -> Prop := @Logic.eq positive.
Definition eq_equiv: Equivalence eq := @eq_equivalence t. (*apply eq_equivalence. Qed.*)
Definition lt : t -> t -> Prop := Plt.

(* Specifications: *)
Lemma lt_strorder:  StrictOrder lt. apply Positive_as_OT.lt_strorder. Qed.
Lemma lt_compat : Proper (Logic.eq ==> Logic.eq ==> iff) lt.
apply Positive_as_OT.lt_compat. Qed.