proposition: Lemma expr0n n : 0 ^+ n = (n == 0%N)%:R :> R.
proof: Proof. by case: n => // n; rewrite exprS mul0r. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)