proposition: Lemma convnE n (g : 'I_n.+1 -> A) (d : {fdist 'I_n.+1}) (i1 : d ord0 != 1%coqR) : <|>_d g = g ord0 <| probfdist d ord0 |> <|>_(fdist_del i1) (fun x => g (fdist_del_idx ord0 x)).
proof: Proof. rewrite /=; case: Bool.bool_dec => /= [|/Bool.eq_true_not_negb] H. exfalso; by rewrite (eqP H) eqxx in i1. by rewrite (boolp.Prop_irrelevance H i1). Qed.
imports: mathcomp(all_ssreflect ssralg ssrnum matrix fingroup perm) Reals Lra mathcomp(mathcomp_extra Rstruct reals) ssrR Reals_ext realType_ext Ranalysis_ext ssr_ext ssralg_ext logb fdist convex