simplifications

coq/SMTArith.v

@@ -603,9 +603,16 @@ Proof with try discriminate.
 Qed.
 *)
 
-(*
 Lemma checkPre_smt_pre E P q :
-  checkPre P q = true -> eval_smt_logic E q -> eval_precond E P.
+  checkPre P q = true ->
+  eval_smt_logic E q ->
+  eval_precond E P.
+Proof.
+  intros Heq Hq.
+  apply smt_to_pre_correct.
+  now apply (SMTLogic_eqb_sound _ _ _ Heq).
+Qed.
+(*
 Proof with try discriminate.
   unfold P_intv_sound, checkPre.
   induction (FloverMap.elements P) as [|[e [lo hi]] l IHl] in q |- *.
@@ -663,7 +670,7 @@ Proof.
   apply Rnot_lt_le. intros B.
   apply H2. eapply precond_bound_correct; eauto.
   split; cbn; auto.
-  do 2 eexists. repeat split; first [eassumption | constructor].
+  exists v, (Q2R r). repeat split; auto. constructor.
 Qed.
 
 Lemma RangeBound_high_sound E P preQ e r Gamma v :
@@ -678,5 +685,5 @@ Proof.
   apply Rnot_lt_le. intros B.
   apply H2. eapply precond_bound_correct; eauto.
   split; cbn; auto.
-  do 2 eexists. repeat split; first [eassumption | constructor].
+  exists (Q2R r), v. repeat split; auto. constructor.
 Qed.