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