Description: Alternate proof of itg2add using the "buffer zone" definition from the first lemma, in which every simple function in the set is divided into to by dividing its buffer by a third and finding the largest allowable function locked to a grid laid out in increments of the new, smaller buffer up to the original simple function. The measurability of this function follows from that of the augend, and subtracting it from the original simple function yields another simple function by i1fsub , which is allowable by the fact that the grid must have a mark between one third and two thirds the original buffer. This has two advantages over the current approach: first, eliminating ax-cc , and second, weakening the measurability hypothesis to only the augend. (Contributed by Brendan Leahy, 31-Oct-2017) (Revised by Brendan Leahy, 13-Mar-2018)
Ref | Expression | ||
---|---|---|---|
Hypotheses | itg2addnc.f1 | |
|
itg2addnc.f2 | |
||
itg2addnc.f3 | |
||
itg2addnc.g2 | |
||
itg2addnc.g3 | |
||
Assertion | itg2addnc | |