proposition: Lemma Zeq_bool_correct_t : forall m n : Z, Zeq_bool m n = true -> (m = n)%Z.
proof: Proof. intros m n H. apply Zcompare_Eq_eq. unfold Zeq_bool in H. induction (m ?= n)%Z ; try discriminate. exact (refl_equal _). Qed.
imports: Gappa_real Gappa_definitions Gappa_dyadic