proposition: Theorem ceval_deterministic: forall c st st1 st2, st =[ c ]=> st1 -> st =[ c ]=> st2 -> st1 = st2.
proof: Proof. intros c st st1 st2 E1 E2; generalize dependent st2; induction E1; intros st2 E2; inversion E2; subst. - reflexivity. - reflexivity. - rewrite (IHE1_1 st'0 H1) in *. apply IHE1_2. assumption. - apply IHE1. assumption. - rewrite H in H5. discriminate. - rewrite H in H5. discriminate. - apply IHE1. assumption. - reflexivity. - rewrite H in H2. discriminate. - rewrite H in H4. discriminate. - rewrite (IHE1_1 st'0 H3) in *. apply IHE1_2. assumption. Qed.
imports: Coq(Lia) LF(Maps) LF(Imp)