proposition: Lemma allocb_coherent : coherent allocb_sp.
proof: Proof. move=>p x m; split. - by case=>i [H1][->] ->; exists i; exists H1; exists i. by case=>i [H1][_][<-][->] ->; exists i. Qed.
imports: mathcomp(ssreflect ssrbool ssrfun ssrnat eqtype seq) LemmaOverloading(prelude heaps rels hprop domains)