fact: Fixpoint binomial_p l := match l with | nil => fix loop m := match m with | nil => 1 | y::m => binomial 0 y * loop m end | x::l => fun m => match m with | nil => binomial x 0 * binomial_p l nil | y::m => binomial x y * binomial_p l m end end.
imports: Arith Nat Lia List Undecidability.Shared.Libs.DLW.Utils(utils_tac gcd prime binomial sums rel_iter) Undecidability.H10.ArithLibs(Zp)