proposition: Lemma big_nil : forall (P : pred I) F, \big[op/idx]_(i <- [::] | P i) F i === idx.
proof: Proof. by reflexivity. Qed.
imports: ssreflect ssrbool ssrfun eqtype ssrnat seq div choice fintype finfun paths Setoid Morphisms OperationClasses bigops