proposition: Lemma F10aux n: \sum_(i<n) i ^6 = 'C(n, 2) + (31 *2) * 'C(n, 3) + (90 * 6) * 'C(n, 4) + (65 * 24) * 'C(n, 5) + (15 * 120) * 'C(n, 6) + 720 * 'C(n, 7).
proof: Proof. by rewrite sum_pow 7! big_ord_recr /= big_ord0 mul0n mul1n. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype) mathcomp(ssrnat seq path div) mathcomp(fintype tuple finfun bigop finset binomial)