fact: Definition sepit (s : seq A) (f : A -> Pred U) : Pred U := [Pred h | exists hs : seq U, [ /\ size hs = size s, h = seqjoin hs & All [pts a h | h \In f a] (seq.zip s hs) ] ].
imports: Coq(ssreflect ssrbool ssrfun) mathcomp(ssrnat eqtype seq bigop fintype finset) pcm(options axioms prelude seqperm pred seqext)