fact: Variable (m k k' u w : nat) (f : nat -> nat) (Hm : 2*m < r) (Hf1 : forall i, i < m -> f i <= k) (Hf2 : forall i j, i < j < m -> f i < f j) (Hw : w = ∑ k' (fun i => power i r)) (Hu : u = ∑ m (fun i => power (f i) r)).
imports: Arith Lia List Bool Undecidability.Shared.Libs.DLW.Utils(utils_tac gcd sums rel_iter bool_nat power_decomp prime)