proposition: Lemma rApply2 s0 s1 xs t : mprv (\and_(<-xs) ---> s0) -> mprv (\and_(<-xs) ---> s1) -> mprv (\and_(<- s0 ---> s1 ---> t :: xs) ---> t).
proof: Proof. move => *. rule (axS s1). by apply rApply. by rewrite -> bigAdrop. Qed.
imports: mathcomp(all_ssreflect) CompDecModal.libs(edone base fset induced_sym) Setoid Morphisms Relation_Definitions