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