proposition: Lemma SCF_opp l: SCF [seq -x | x <- l] = - SCF l.
proof: Proof. by case: l => // a l /=; rewrite opprD SCF'_opp. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat) mathcomp(seq choice fintype order bigop ssralg) mathcomp(div ssrnum ssrint rat prime path binomial) mathcomp(tuple finset) gaia(fibm)