fact: Definition T_ln x n := let lg := C.ln u x in let y := C.mask x lg in P.polyCons lg (if n is n'.+1 then let p1 := (-1)%Z in P.dotmuldiv u (falling_seq p1 n') (behead (fact_seq n)) (P.rec1 (pow_aux_rec u p1 y) (C.power_int u y p1) n') else P.polyNil).
imports: Coq(ZArith Reals) Flocq(Raux) mathcomp.ssreflect(ssreflect ssrfun ssrbool eqtype ssrnat seq fintype bigop) Interval Datatypes Basic_rec