Description: Lemma for mbfi1fseq . This lemma is not as interesting as it is long - it is simply checking that G is in fact a sequence of simple functions, by verifying that its range is in ( 0 ... n 2 ^ n ) / ( 2 ^ n ) (which is to say, the numbers from 0 to n in increments of 1 / ( 2 ^ n ) ), and also that the preimage of each point k is measurable, because it is equal to ( -u n , n ) i^i (`' F " ( k [,) k + 1 / ( 2 ^ n ) ) ) for k < n and ( -u n , n ) i^i ( ``' F " ( k [,) +oo ) ) for k = n ` . (Contributed by Mario Carneiro, 16-Aug-2014)
Ref | Expression | ||
---|---|---|---|
Hypotheses | mbfi1fseq.1 | |
|
mbfi1fseq.2 | |
||
mbfi1fseq.3 | |
||
mbfi1fseq.4 | |
||
Assertion | mbfi1fseqlem4 | |