Make the proofs compile at the costs of admits

coq/CertificateChecker.v

@@ -106,8 +106,10 @@ Definition CertificateCheckerCmd (f:cmd Q) (absenv:analysisResult) (P:precond)
   end.
 
 Theorem Certificate_checking_cmds_is_sound (f:cmd Q) (absenv:analysisResult) P
-        defVars:
+        defVars DeltaMap:
   forall (E1 E2:env),
+    (forall (e' : expr R) (m' : mType),
+        exists d : R, DeltaMap e' m' = Some d /\ (Rabs d <= mTypeToR m')%R) ->
     (forall v, NatSet.In v (freeVars f) ->
           exists vR, E1 v = Some vR /\
                 (Q2R (fst (P v)) <= vR <= Q2R (snd (P v)))%R) ->
@@ -117,21 +119,24 @@ Theorem Certificate_checking_cmds_is_sound (f:cmd Q) (absenv:analysisResult) P
       exists iv err vR vF m,
     FloverMap.find  (getRetExp f) absenv = Some (iv,err) /\
     bstep (toREvalCmd (toRCmd f)) E1 (toRTMap (toRExpMap Gamma)) DeltaMapR vR REAL /\
-    bstep (toRCmd f) E2 (toRExpMap Gamma) vF m /\
+    bstep (toRCmd f) E2 (toRExpMap Gamma) DeltaMap vF m /\
     (forall vF m,
-        bstep (toRCmd f) E2 (toRExpMap Gamma)  vF m ->
+        bstep (toRCmd f) E2 (toRExpMap Gamma) DeltaMap vF m ->
         (Rabs (vR - vF) <= Q2R (err))%R).
 (**
    The proofs is a simple composition of the soundness proofs for the range
    validator and the error bound validator.
 **)
 Proof.
-  intros * P_valid certificate_valid.
+  intros * deltas_matched P_valid certificate_valid.
   unfold CertificateCheckerCmd in certificate_valid.
   destruct (getValidMapCmd defVars f (FloverMap.empty mType)) eqn:?;
                            try congruence.
   rename t into Gamma.
-  assert (validTypesCmd f Gamma).
+  assert (validTypesCmd f Gamma DeltaMap).
+  { eapply getValidMapCmd_correct; try eauto.
+    intros; cbn in *; congruence. }
+  assert (validTypesCmd f Gamma DeltaMapR).
   { eapply getValidMapCmd_correct; try eauto.
     intros; cbn in *; congruence. }
   exists Gamma; intros approxE1E2.