Description: An upper bound on the partial sums of the CNF function. Since each term dominates all previous terms, by induction we can bound the whole sum with any exponent A ^o C where C is larger than any exponent ( Gx ) , x e. K which has been summed so far. (Contributed by Mario Carneiro, 28-May-2015) (Revised by AV, 29-Jun-2019)
Ref | Expression | ||
---|---|---|---|
Hypotheses | cantnfs.s | |
|
cantnfs.a | |
||
cantnfs.b | |
||
cantnfcl.g | |
||
cantnfcl.f | |
||
cantnfval.h | |
||
cantnflt.a | |
||
cantnflt.k | |
||
cantnflt.c | |
||
cantnflt.s | |
||
Assertion | cantnflt | |