proposition: Lemma try_case_pf A B i (s1 : A -> spec B) (s2 : exn -> spec B) r p (e : try_form i s1 s2 r p) : p -> verify (try_s e s1 s2) i r.
proof: Proof. by case:e=>[?]; apply. Qed.
imports: mathcomp(ssreflect ssrbool ssrfun) LemmaOverloading(heaps rels stmod stsep stlog)