proposition: Lemma CZlt_to : forall x y : Z, Zlts x y -> (x < y)%Z.
proof: Proof. intros x y H. unfold Z.lt in |- *. inversion H. auto. Qed.
imports: Coq.Arith.Compare_dec CoRN.logic.CornBasics Coq.ZArith.ZArith Coq.setoid_ring.ZArithRing Coq.Arith.Wf_nat Coq(Lia)