proposition: Lemma lagrange_poly_correct {R: fieldType} (x y: R) pts: uniq (unzip1 (pts)) -> (x, y) \in pts -> (lagrange_poly pts).[x] = y.
proof: Proof. case: pts => [// | m r] Huniq Hin. by apply: lagrange_poly_part_correct. Qed.
imports: Relational(OrderEnrichedCategory GenericRulesSimple) mathcomp(all_ssreflect all_algebra reals distr realsum ssrnat ssreflect ssrfun ssrbool ssrnum eqtype choice seq) Mon(SPropBase) Crypt(Axioms ChoiceAsOrd SubDistr Couplings UniformDistrLemmas FreeProbProg Theta_dens RulesStateProb pkg_core_definition choice_type pkg_composition pkg_rhl Package Prelude) extructures(ord fset fmap) Equations(Equations)