proposition: Lemma Zge_is_ge_bool : forall x y, (x >= y)%Z <-> (Zge_bool x y = true).
proof: Proof. intros x y;assert (W:=Zge_cases x y);destruct (Zge_bool x y). split;auto. split;[intros;auto with zarith | discriminate]. Qed.
imports: List PArray Bool Int63 ZMicromega ZArith Misc State SMT_terms BVList