fact: Definition prog_sup (u : Pred ST) : prog (pre_sup u) A := fun i V P y m => exists e (pf : e \In u), prog_of e _ V (pre_sup_leq pf P) y m.
imports: mathcomp(ssreflect ssrbool ssrfun ssrnat eqtype seq) pcm(options axioms pred prelude) pcm(pcm unionmap heap) htt(domain)