proposition: Lemma exec_deterministic: forall ei p ef, (exec ei p ef) -> forall ef', (exec ei p ef') -> ef=ef'.
proof: Proof. induction 1; intros ef' X; exec_inversion X; eauto. intros e1 e2 X1 X2; assert (X3: e'=e1); auto. subst; auto. Qed.
imports: hoarelogicsemantics