proposition: Lemma read_over_other_write : forall a i j v, i <> j -> select (store a i v) j = select a j.
proof: Proof. intros a i j v Hneq. unfold select, store. rewrite add_neq_o; auto. Qed.
imports: SetoidList Bool OrderedType OrdersLists RelationPairs Orders RelationClasses