proposition: Lemma lt_Z_B2P': forall x y, ltP_Z x y <-> Z.lt x y.
proof: Proof. intros x y; split; intro H. unfold ltP_Z in H. case_eq ((x <? y)%Z ); intros; rewrite H0 in H; try easy. now apply Z.ltb_lt in H0. apply lt_Z_B2P. now apply Z.ltb_lt. Qed.
imports: Bool OrderedType BinPos ZArith OrderedTypeEx Int63 State BVList FArray SMT_classes