fact: Definition bind_prog : prog bind_pre B := fun i V P y m => exists x h (Ph : h \In prog_of e1 _ V (bind_pre_proj P) x), match x with | Val x' => exists Ph' : h \In pre_of (e2 x'), m \In prog_of (e2 x') _ (dstr_valid Ph) Ph' y | Exn e => y = Exn e /\ m = h end.
imports: mathcomp(ssreflect ssrbool ssrfun ssrnat eqtype seq) pcm(options axioms pred prelude) pcm(pcm unionmap heap) htt(domain)