(* Contribution to the Coq Library   V6.3 (July 1999)                    *)
Definition leZ (x y : Z) :=
match x return Prop with
| OZ =>
match y return Prop with
| OZ => True
| pos n => True
| neg n => False
end
| pos n =>
match y return Prop with
| OZ => False
| pos m => n <= m
| neg m => False
end
| neg n =>
match y return Prop with
| OZ => True
| pos m => True
| neg m => m <= n
end
end.

Lemma sign_absZ : forall x : Z, leZ OZ (absZ x).
intros; elim x; simpl in |- *.