HomeHome Metamath Proof Explorer
Theorem List (p. 190 of 311)
< Previous  Next >
Browser slow? Try the
Unicode version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-21328)
  Hilbert Space Explorer  Hilbert Space Explorer
(21329-22851)
  Users' Mathboxes  Users' Mathboxes
(22852-31058)
 

Theorem List for Metamath Proof Explorer - 18901-19000   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremitg1climres 18901* Restricting the simple function  F to the increasing sequence  A ( n ) of measurable sets whose union is  RR yields a sequence of simple functions whose integrals approach the integral of  F. (Contributed by Mario Carneiro, 15-Aug-2014.)
 |-  ( ph  ->  A : NN --> dom  vol )   &    |-  (
 ( ph  /\  n  e. 
 NN )  ->  ( A `  n )  C_  ( A `  ( n  +  1 ) ) )   &    |-  ( ph  ->  U.
 ran  A  =  RR )   &    |-  ( ph  ->  F  e.  dom  S.1 )   &    |-  G  =  ( x  e.  RR  |->  if ( x  e.  ( A `  n ) ,  ( F `  x ) ,  0 )
 )   =>    |-  ( ph  ->  ( n  e.  NN  |->  ( S.1 `  G ) )  ~~>  ( S.1 `  F ) )
 
Theoremmbfi1fseqlem1 18902* Lemma for mbfi1fseq 18908. (Contributed by Mario Carneiro, 16-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  J  =  ( m  e.  NN ,  y  e.  RR  |->  ( ( |_ `  (
 ( F `  y
 )  x.  ( 2 ^ m ) ) )  /  ( 2 ^ m ) ) )   =>    |-  ( ph  ->  J : ( NN  X.  RR ) --> ( 0 [,)  +oo ) )
 
Theoremmbfi1fseqlem2 18903* Lemma for mbfi1fseq 18908. (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  J  =  ( m  e.  NN ,  y  e.  RR  |->  ( ( |_ `  (
 ( F `  y
 )  x.  ( 2 ^ m ) ) )  /  ( 2 ^ m ) ) )   &    |-  G  =  ( m  e.  NN  |->  ( x  e.  RR  |->  if ( x  e.  ( -u m [,] m ) ,  if ( ( m J x ) 
 <_  m ,  ( m J x ) ,  m ) ,  0 ) ) )   =>    |-  ( A  e.  NN  ->  ( G `  A )  =  ( x  e.  RR  |->  if ( x  e.  ( -u A [,] A ) ,  if ( ( A J x )  <_  A ,  ( A J x ) ,  A ) ,  0 ) ) )
 
Theoremmbfi1fseqlem3 18904* Lemma for mbfi1fseq 18908. (Contributed by Mario Carneiro, 16-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  J  =  ( m  e.  NN ,  y  e.  RR  |->  ( ( |_ `  (
 ( F `  y
 )  x.  ( 2 ^ m ) ) )  /  ( 2 ^ m ) ) )   &    |-  G  =  ( m  e.  NN  |->  ( x  e.  RR  |->  if ( x  e.  ( -u m [,] m ) ,  if ( ( m J x ) 
 <_  m ,  ( m J x ) ,  m ) ,  0 ) ) )   =>    |-  ( ( ph  /\  A  e.  NN )  ->  ( G `  A ) : RR --> ran  (  m  e.  ( 0 ... ( A  x.  (
 2 ^ A ) ) )  |->  ( m 
 /  ( 2 ^ A ) ) ) )
 
Theoremmbfi1fseqlem4 18905* Lemma for mbfi1fseq 18908. 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.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  J  =  ( m  e.  NN ,  y  e.  RR  |->  ( ( |_ `  (
 ( F `  y
 )  x.  ( 2 ^ m ) ) )  /  ( 2 ^ m ) ) )   &    |-  G  =  ( m  e.  NN  |->  ( x  e.  RR  |->  if ( x  e.  ( -u m [,] m ) ,  if ( ( m J x ) 
 <_  m ,  ( m J x ) ,  m ) ,  0 ) ) )   =>    |-  ( ph  ->  G : NN --> dom  S.1 )
 
Theoremmbfi1fseqlem5 18906* Lemma for mbfi1fseq 18908. Verify that  G describes an increasing sequence of positive functions. (Contributed by Mario Carneiro, 16-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  J  =  ( m  e.  NN ,  y  e.  RR  |->  ( ( |_ `  (
 ( F `  y
 )  x.  ( 2 ^ m ) ) )  /  ( 2 ^ m ) ) )   &    |-  G  =  ( m  e.  NN  |->  ( x  e.  RR  |->  if ( x  e.  ( -u m [,] m ) ,  if ( ( m J x ) 
 <_  m ,  ( m J x ) ,  m ) ,  0 ) ) )   =>    |-  ( ( ph  /\  A  e.  NN )  ->  ( 0 p  o R  <_  ( G `  A )  /\  ( G `
  A )  o R  <_  ( G `  ( A  +  1 ) ) ) )
 
Theoremmbfi1fseqlem6 18907* Lemma for mbfi1fseq 18908. Verify that  G converges pointwise to  F, and wrap up the existence quantifier. (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  J  =  ( m  e.  NN ,  y  e.  RR  |->  ( ( |_ `  (
 ( F `  y
 )  x.  ( 2 ^ m ) ) )  /  ( 2 ^ m ) ) )   &    |-  G  =  ( m  e.  NN  |->  ( x  e.  RR  |->  if ( x  e.  ( -u m [,] m ) ,  if ( ( m J x ) 
 <_  m ,  ( m J x ) ,  m ) ,  0 ) ) )   =>    |-  ( ph  ->  E. g ( g : NN --> dom  S.1  /\  A. n  e.  NN  (
 0 p  o R  <_  ( g `  n )  /\  ( g `  n )  o R  <_  ( g `  ( n  +  1 )
 ) )  /\  A. x  e.  RR  ( n  e.  NN  |->  ( ( g `  n ) `
  x ) )  ~~>  ( F `  x ) ) )
 
Theoremmbfi1fseq 18908* A characterization of measurability in terms of simple functions (this is an if and only if for nonnegative functions, although we don't prove it). Any nonnegative measurable function is the limit of an increasing sequence of nonnegative simple functions. This proof is an example of a poor de Bruijn factor - the formalized proof is much longer than an average hand proof, which usually just describes the function  G and "leaves the details as an exercise to the reader". (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   =>    |-  ( ph  ->  E. g ( g : NN --> dom  S.1  /\  A. n  e.  NN  (
 0 p  o R  <_  ( g `  n )  /\  ( g `  n )  o R  <_  ( g `  ( n  +  1 )
 ) )  /\  A. x  e.  RR  ( n  e.  NN  |->  ( ( g `  n ) `
  x ) )  ~~>  ( F `  x ) ) )
 
Theoremmbfi1flimlem 18909* Lemma for mbfi1flim 18910. (Contributed by Mario Carneiro, 5-Sep-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> RR )   =>    |-  ( ph  ->  E. g ( g : NN --> dom  S.1  /\ 
 A. x  e.  RR  ( n  e.  NN  |->  ( ( g `  n ) `  x ) )  ~~>  ( F `  x ) ) )
 
Theoremmbfi1flim 18910* Any real measurable function has a sequence of simple functions that converges to it. (Contributed by Mario Carneiro, 5-Sep-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : A --> RR )   =>    |-  ( ph  ->  E. g ( g : NN --> dom  S.1  /\ 
 A. x  e.  A  ( n  e.  NN  |->  ( ( g `  n ) `  x ) )  ~~>  ( F `  x ) ) )
 
Theoremmbfmullem2 18911* Lemma for mbfmul 18913. (Contributed by Mario Carneiro, 7-Sep-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  G  e. MblFn )   &    |-  ( ph  ->  F : A --> RR )   &    |-  ( ph  ->  G : A --> RR )   &    |-  ( ph  ->  P : NN --> dom  S.1 )   &    |-  ( ( ph  /\  x  e.  A )  ->  ( n  e.  NN  |->  ( ( P `  n ) `
  x ) )  ~~>  ( F `  x ) )   &    |-  ( ph  ->  Q : NN --> dom  S.1 )   &    |-  ( ( ph  /\  x  e.  A )  ->  ( n  e.  NN  |->  ( ( Q `  n ) `
  x ) )  ~~>  ( G `  x ) )   =>    |-  ( ph  ->  ( F  o F  x.  G )  e. MblFn )
 
Theoremmbfmullem 18912 Lemma for mbfmul 18913. (Contributed by Mario Carneiro, 7-Sep-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  G  e. MblFn )   &    |-  ( ph  ->  F : A --> RR )   &    |-  ( ph  ->  G : A --> RR )   =>    |-  ( ph  ->  ( F  o F  x.  G )  e. MblFn )
 
Theoremmbfmul 18913 The product of two measurable functions is measurable. (Contributed by Mario Carneiro, 7-Sep-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  G  e. MblFn )   =>    |-  ( ph  ->  ( F  o F  x.  G )  e. MblFn )
 
Theoremitg2lcl 18914* The set of lower sums is a set of extended reals. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  L  =  { x  |  E. g  e.  dom  S.1 ( g  o R  <_  F  /\  x  =  ( S.1 `  g
 ) ) }   =>    |-  L  C_  RR*
 
Theoremitg2val 18915* Value of the integral on nonnegative real functions. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  L  =  { x  |  E. g  e.  dom  S.1 ( g  o R  <_  F  /\  x  =  ( S.1 `  g
 ) ) }   =>    |-  ( F : RR
 --> ( 0 [,]  +oo )  ->  ( S.2 `  F )  =  sup ( L ,  RR* ,  <  )
 )
 
Theoremitg2l 18916* Elementhood in the set  L of lower sums of the integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  L  =  { x  |  E. g  e.  dom  S.1 ( g  o R  <_  F  /\  x  =  ( S.1 `  g
 ) ) }   =>    |-  ( A  e.  L 
 <-> 
 E. g  e.  dom  S.1 ( g  o R  <_  F  /\  A  =  ( S.1 `  g )
 ) )
 
Theoremitg2lr 18917* Sufficient condition for elementhood in the set  L. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  L  =  { x  |  E. g  e.  dom  S.1 ( g  o R  <_  F  /\  x  =  ( S.1 `  g
 ) ) }   =>    |-  ( ( G  e.  dom  S.1  /\  G  o R  <_  F ) 
 ->  ( S.1 `  G )  e.  L )
 
Theoremxrge0f 18918 A real function is a nonnegative extended real function if all its values are greater or equal to zero. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 28-Jul-2014.)
 |-  ( ( F : RR
 --> RR  /\  0 p  o R  <_  F )  ->  F : RR --> ( 0 [,]  +oo ) )
 
Theoremitg2cl 18919 The integral of a nonnegative real function is an extended real number. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( F : RR --> ( 0 [,]  +oo )  ->  ( S.2 `  F )  e.  RR* )
 
Theoremitg2ub 18920 The integral of a nonnegative real function  F is an upper bound on the integrals of all simple functions  G dominated by  F. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( ( F : RR
 --> ( 0 [,]  +oo )  /\  G  e.  dom  S.1  /\  G  o R  <_  F )  ->  ( S.1 `  G )  <_  ( S.2 `  F ) )
 
Theoremitg2leub 18921* Any upper bound on the integrals of all simple functions  G dominated by  F is greater than  ( S.2 `  F
), the least upper bound. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( ( F : RR
 --> ( 0 [,]  +oo )  /\  A  e.  RR* )  ->  ( ( S.2 `  F )  <_  A  <->  A. g  e.  dom  S.1 ( g  o R  <_  F  ->  ( S.1 `  g )  <_  A ) ) )
 
Theoremitg2ge0 18922 The integral of a nonnegative real function is greater or equal to zero. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( F : RR --> ( 0 [,]  +oo )  ->  0  <_  ( S.2 `  F ) )
 
Theoremitg2itg1 18923 The integral of a nonnegative simple function using  S.2 is the same as its value under  S.1. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( ( F  e.  dom  S.1  /\  0 p  o R  <_  F )  ->  ( S.2 `  F )  =  ( S.1 `  F ) )
 
Theoremitg20 18924 The integral of the zero function. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( S.2 `  ( RR  X.  { 0 } ) )  =  0
 
Theoremitg2lecl 18925 If an  S.2 integral is bounded above, then it is real. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( ( F : RR
 --> ( 0 [,]  +oo )  /\  A  e.  RR  /\  ( S.2 `  F )  <_  A )  ->  ( S.2 `  F )  e.  RR )
 
Theoremitg2le 18926 If one function dominates another, then the integral of the larger is also larger. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( ( F : RR
 --> ( 0 [,]  +oo )  /\  G : RR --> ( 0 [,]  +oo )  /\  F  o R  <_  G )  ->  ( S.2 `  F )  <_  ( S.2 `  G )
 )
 
Theoremitg2const 18927* Integral of a constant function. (Contributed by Mario Carneiro, 12-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( A  e.  dom 
 vol  /\  ( vol `  A )  e.  RR  /\  B  e.  ( 0 [,)  +oo ) )  ->  ( S.2 `  ( x  e.  RR  |->  if ( x  e.  A ,  B ,  0 ) ) )  =  ( B  x.  ( vol `  A ) ) )
 
Theoremitg2const2 18928* When the base set of a constant function has infinite volume, the integral is also infinite and vice-versa. (Contributed by Mario Carneiro, 30-Aug-2014.)
 |-  ( ( A  e.  dom 
 vol  /\  B  e.  RR+ )  ->  ( ( vol `  A )  e.  RR  <->  ( S.2 `  ( x  e. 
 RR  |->  if ( x  e.  A ,  B , 
 0 ) ) )  e.  RR ) )
 
Theoremitg2seq 18929* Definitional property of the  S.2 integral: for any function  F there is a countable sequence 
g of simple functions less than  F whose integrals converge to the integral of  F. (This theorem is for the most part unnecessary in lieu of itg2i1fseq 18942, but unlike that theorem this one doesn't require  F to be measurable.) (Contributed by Mario Carneiro, 14-Aug-2014.)
 |-  ( F : RR --> ( 0 [,]  +oo )  ->  E. g ( g : NN --> dom  S.1  /\ 
 A. n  e.  NN  ( g `  n )  o R  <_  F  /\  ( S.2 `  F )  =  sup ( ran  (  n  e.  NN  |->  ( S.1 `  ( g `  n ) ) ) ,  RR* ,  <  )
 ) )
 
Theoremitg2uba 18930* Approximate version of itg2ub 18920. If  F approximately dominates  G, then  S.1 G  <_  S.2 F. (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,]  +oo ) )   &    |-  ( ph  ->  G  e.  dom  S.1 )   &    |-  ( ph  ->  A  C_  RR )   &    |-  ( ph  ->  ( vol * `  A )  =  0 )   &    |-  (
 ( ph  /\  x  e.  ( RR  \  A ) )  ->  ( G `
  x )  <_  ( F `  x ) )   =>    |-  ( ph  ->  ( S.1 `  G )  <_  ( S.2 `  F )
 )
 
Theoremitg2lea 18931* Approximate version of itg2le 18926. If  F  <_  G for almost all  x, then  S.2 F  <_  S.2 G. (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,]  +oo ) )   &    |-  ( ph  ->  G : RR --> ( 0 [,]  +oo ) )   &    |-  ( ph  ->  A  C_  RR )   &    |-  ( ph  ->  ( vol * `  A )  =  0 )   &    |-  (
 ( ph  /\  x  e.  ( RR  \  A ) )  ->  ( F `
  x )  <_  ( G `  x ) )   =>    |-  ( ph  ->  ( S.2 `  F )  <_  ( S.2 `  G )
 )
 
Theoremitg2eqa 18932* Approximate equality of integrals. If  F  =  G for almost all  x, then  S.2 F  = 
S.2 G. (Contributed by Mario Carneiro, 12-Aug-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,]  +oo ) )   &    |-  ( ph  ->  G : RR --> ( 0 [,]  +oo ) )   &    |-  ( ph  ->  A  C_  RR )   &    |-  ( ph  ->  ( vol * `  A )  =  0 )   &    |-  (
 ( ph  /\  x  e.  ( RR  \  A ) )  ->  ( F `
  x )  =  ( G `  x ) )   =>    |-  ( ph  ->  ( S.2 `  F )  =  ( S.2 `  G ) )
 
Theoremitg2mulclem 18933 Lemma for itg2mulc 18934. (Contributed by Mario Carneiro, 8-Jul-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  (
 S.2 `  F )  e.  RR )   &    |-  ( ph  ->  A  e.  RR+ )   =>    |-  ( ph  ->  ( S.2 `  ( ( RR 
 X.  { A } )  o F  x.  F ) )  <_  ( A  x.  ( S.2 `  F ) ) )
 
Theoremitg2mulc 18934 The integral of a nonnegative constant times a function is the constant times the integral of the original function. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  (
 S.2 `  F )  e.  RR )   &    |-  ( ph  ->  A  e.  ( 0 [,)  +oo ) )   =>    |-  ( ph  ->  ( S.2 `  ( ( RR 
 X.  { A } )  o F  x.  F ) )  =  ( A  x.  ( S.2 `  F ) ) )
 
Theoremitg2splitlem 18935* Lemma for itg2split 18936. (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( ph  ->  A  e.  dom  vol )   &    |-  ( ph  ->  B  e.  dom  vol )   &    |-  ( ph  ->  ( vol * `  ( A  i^i  B ) )  =  0
 )   &    |-  ( ph  ->  U  =  ( A  u.  B ) )   &    |-  ( ( ph  /\  x  e.  U ) 
 ->  C  e.  ( 0 [,]  +oo ) )   &    |-  F  =  ( x  e.  RR  |->  if ( x  e.  A ,  C ,  0 ) )   &    |-  G  =  ( x  e.  RR  |->  if ( x  e.  B ,  C ,  0 ) )   &    |-  H  =  ( x  e.  RR  |->  if ( x  e.  U ,  C ,  0 ) )   &    |-  ( ph  ->  (
 S.2 `  F )  e.  RR )   &    |-  ( ph  ->  (
 S.2 `  G )  e.  RR )   =>    |-  ( ph  ->  ( S.2 `  H )  <_  ( ( S.2 `  F )  +  ( S.2 `  G ) ) )
 
Theoremitg2split 18936* The  S.2 integral splits under an almost disjoint union. (The proof avoids the use of itg2add 18946 which requires CC.) (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( ph  ->  A  e.  dom  vol )   &    |-  ( ph  ->  B  e.  dom  vol )   &    |-  ( ph  ->  ( vol * `  ( A  i^i  B ) )  =  0
 )   &    |-  ( ph  ->  U  =  ( A  u.  B ) )   &    |-  ( ( ph  /\  x  e.  U ) 
 ->  C  e.  ( 0 [,]  +oo ) )   &    |-  F  =  ( x  e.  RR  |->  if ( x  e.  A ,  C ,  0 ) )   &    |-  G  =  ( x  e.  RR  |->  if ( x  e.  B ,  C ,  0 ) )   &    |-  H  =  ( x  e.  RR  |->  if ( x  e.  U ,  C ,  0 ) )   &    |-  ( ph  ->  (
 S.2 `  F )  e.  RR )   &    |-  ( ph  ->  (
 S.2 `  G )  e.  RR )   =>    |-  ( ph  ->  ( S.2 `  H )  =  ( ( S.2 `  F )  +  ( S.2 `  G ) ) )
 
Theoremitg2monolem1 18937* Lemma for itg2mono 18940. We show that for any constant  t less than one,  t  x.  S.1 H is less than  S, and so  S.1 H  <_  S, which is one half of the equality in itg2mono 18940. Consider the sequence  A ( n )  =  { x  |  t  x.  H  <_  F ( n ) }. This is an increasing sequence of measurable sets whose union is  RR, and so  H  |`  A ( n ) has an integral which equals  S.1 H in the limit, by itg1climres 18901. Then by taking the limit in  ( t  x.  H )  |`  A ( n )  <_  F
( n ), we get  t  x.  S.1 H  <_  S as desired. (Contributed by Mario Carneiro, 16-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  G  =  ( x  e.  RR  |->  sup ( ran  (  n  e.  NN  |->  ( ( F `  n ) `  x ) ) ,  RR ,  <  ) )   &    |-  (
 ( ph  /\  n  e. 
 NN )  ->  ( F `  n )  e. MblFn
 )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n ) : RR --> ( 0 [,)  +oo ) )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n )  o R  <_  ( F `  ( n  +  1 ) ) )   &    |-  ( ( ph  /\  x  e.  RR )  ->  E. y  e.  RR  A. n  e. 
 NN  ( ( F `
  n ) `  x )  <_  y )   &    |-  S  =  sup ( ran  (  n  e.  NN  |->  ( S.2 `  ( F `  n ) ) ) ,  RR* ,  <  )   &    |-  ( ph  ->  T  e.  (
 0 (,) 1 ) )   &    |-  ( ph  ->  H  e.  dom  S.1 )   &    |-  ( ph  ->  H  o R  <_  G )   &    |-  ( ph  ->  S  e.  RR )   &    |-  A  =  ( n  e.  NN  |->  { x  e.  RR  |  ( T  x.  ( H `  x ) ) 
 <_  ( ( F `  n ) `  x ) } )   =>    |-  ( ph  ->  ( T  x.  ( S.1 `  H ) )  <_  S )
 
Theoremitg2monolem2 18938* Lemma for itg2mono 18940. (Contributed by Mario Carneiro, 16-Aug-2014.)
 |-  G  =  ( x  e.  RR  |->  sup ( ran  (  n  e.  NN  |->  ( ( F `  n ) `  x ) ) ,  RR ,  <  ) )   &    |-  (
 ( ph  /\  n  e. 
 NN )  ->  ( F `  n )  e. MblFn
 )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n ) : RR --> ( 0 [,)  +oo ) )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n )  o R  <_  ( F `  ( n  +  1 ) ) )   &    |-  ( ( ph  /\  x  e.  RR )  ->  E. y  e.  RR  A. n  e. 
 NN  ( ( F `
  n ) `  x )  <_  y )   &    |-  S  =  sup ( ran  (  n  e.  NN  |->  ( S.2 `  ( F `  n ) ) ) ,  RR* ,  <  )   &    |-  ( ph  ->  P  e.  dom  S.1 )   &    |-  ( ph  ->  P  o R  <_  G )   &    |-  ( ph  ->  -.  ( S.1 `  P )  <_  S )   =>    |-  ( ph  ->  S  e.  RR )
 
Theoremitg2monolem3 18939* Lemma for itg2mono 18940. (Contributed by Mario Carneiro, 16-Aug-2014.)
 |-  G  =  ( x  e.  RR  |->  sup ( ran  (  n  e.  NN  |->  ( ( F `  n ) `  x ) ) ,  RR ,  <  ) )   &    |-  (
 ( ph  /\  n  e. 
 NN )  ->  ( F `  n )  e. MblFn
 )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n ) : RR --> ( 0 [,)  +oo ) )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n )  o R  <_  ( F `  ( n  +  1 ) ) )   &    |-  ( ( ph  /\  x  e.  RR )  ->  E. y  e.  RR  A. n  e. 
 NN  ( ( F `
  n ) `  x )  <_  y )   &    |-  S  =  sup ( ran  (  n  e.  NN  |->  ( S.2 `  ( F `  n ) ) ) ,  RR* ,  <  )   &    |-  ( ph  ->  P  e.  dom  S.1 )   &    |-  ( ph  ->  P  o R  <_  G )   &    |-  ( ph  ->  -.  ( S.1 `  P )  <_  S )   =>    |-  ( ph  ->  ( S.1 `  P )  <_  S )
 
Theoremitg2mono 18940* The Monotone Convergence Theorem for nonnegative functions. If  { ( F `
 n ) : n  e.  NN } is a monotone increasing sequence of positive, measurable, real-valued functions, and  G is the pointwise limit of the sequence, then  ( S.2 `  G
) is the limit of the sequence  { ( S.2 `  ( F `  n
) ) : n  e.  NN }. (Contributed by Mario Carneiro, 16-Aug-2014.)
 |-  G  =  ( x  e.  RR  |->  sup ( ran  (  n  e.  NN  |->  ( ( F `  n ) `  x ) ) ,  RR ,  <  ) )   &    |-  (
 ( ph  /\  n  e. 
 NN )  ->  ( F `  n )  e. MblFn
 )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n ) : RR --> ( 0 [,)  +oo ) )   &    |-  ( ( ph  /\  n  e.  NN )  ->  ( F `  n )  o R  <_  ( F `  ( n  +  1 ) ) )   &    |-  ( ( ph  /\  x  e.  RR )  ->  E. y  e.  RR  A. n  e. 
 NN  ( ( F `
  n ) `  x )  <_  y )   &    |-  S  =  sup ( ran  (  n  e.  NN  |->  ( S.2 `  ( F `  n ) ) ) ,  RR* ,  <  )   =>    |-  ( ph  ->  ( S.2 `  G )  =  S )
 
Theoremitg2i1fseqle 18941* Subject to the conditions coming from mbfi1fseq 18908, the sequence of simple functions are all less than the target function  F. (Contributed by Mario Carneiro, 17-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  P : NN --> dom  S.1 )   &    |-  ( ph  ->  A. n  e.  NN  (
 0 p  o R  <_  ( P `  n )  /\  ( P `  n )  o R  <_  ( P `  ( n  +  1 )
 ) ) )   &    |-  ( ph  ->  A. x  e.  RR  ( n  e.  NN  |->  ( ( P `  n ) `  x ) )  ~~>  ( F `  x ) )   =>    |-  ( ( ph  /\  M  e.  NN )  ->  ( P `  M )  o R  <_  F )
 
Theoremitg2i1fseq 18942* Subject to the conditions coming from mbfi1fseq 18908, the integral of the sequence of simple functions converges to the integral of the target function. (Contributed by Mario Carneiro, 17-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  P : NN --> dom  S.1 )   &    |-  ( ph  ->  A. n  e.  NN  (
 0 p  o R  <_  ( P `  n )  /\  ( P `  n )  o R  <_  ( P `  ( n  +  1 )
 ) ) )   &    |-  ( ph  ->  A. x  e.  RR  ( n  e.  NN  |->  ( ( P `  n ) `  x ) )  ~~>  ( F `  x ) )   &    |-  S  =  ( m  e.  NN  |->  ( S.1 `  ( P `  m ) ) )   =>    |-  ( ph  ->  ( S.2 `  F )  =  sup ( ran  S ,  RR* ,  <  ) )
 
Theoremitg2i1fseq2 18943* In an extension to the results of itg2i1fseq 18942, if there is an upper bound on the integrals of the simple functions approaching  F, then  S.2 F is real and the standard limit relation applies. (Contributed by Mario Carneiro, 17-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  P : NN --> dom  S.1 )   &    |-  ( ph  ->  A. n  e.  NN  (
 0 p  o R  <_  ( P `  n )  /\  ( P `  n )  o R  <_  ( P `  ( n  +  1 )
 ) ) )   &    |-  ( ph  ->  A. x  e.  RR  ( n  e.  NN  |->  ( ( P `  n ) `  x ) )  ~~>  ( F `  x ) )   &    |-  S  =  ( m  e.  NN  |->  ( S.1 `  ( P `  m ) ) )   &    |-  ( ph  ->  M  e.  RR )   &    |-  ( ( ph  /\  k  e.  NN )  ->  ( S.1 `  ( P `  k ) ) 
 <_  M )   =>    |-  ( ph  ->  S  ~~>  ( S.2 `  F )
 )
 
Theoremitg2i1fseq3 18944* Special case of itg2i1fseq2 18943: if the integral of  F is a real number, then the standard limit relation holds on the integrals of simple functions approaching 
F. (Contributed by Mario Carneiro, 17-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  P : NN --> dom  S.1 )   &    |-  ( ph  ->  A. n  e.  NN  (
 0 p  o R  <_  ( P `  n )  /\  ( P `  n )  o R  <_  ( P `  ( n  +  1 )
 ) ) )   &    |-  ( ph  ->  A. x  e.  RR  ( n  e.  NN  |->  ( ( P `  n ) `  x ) )  ~~>  ( F `  x ) )   &    |-  S  =  ( m  e.  NN  |->  ( S.1 `  ( P `  m ) ) )   &    |-  ( ph  ->  ( S.2 `  F )  e.  RR )   =>    |-  ( ph  ->  S  ~~>  ( S.2 `  F )
 )
 
Theoremitg2addlem 18945* Lemma for itg2add 18946. (Contributed by Mario Carneiro, 17-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  ( S.2 `  F )  e.  RR )   &    |-  ( ph  ->  G  e. MblFn )   &    |-  ( ph  ->  G : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  (
 S.2 `  G )  e.  RR )   &    |-  ( ph  ->  P : NN --> dom  S.1 )   &    |-  ( ph  ->  A. n  e.  NN  ( 0 p  o R  <_  ( P `  n )  /\  ( P `  n )  o R  <_  ( P `  ( n  +  1 ) ) ) )   &    |-  ( ph  ->  A. x  e.  RR  ( n  e.  NN  |->  ( ( P `  n ) `
  x ) )  ~~>  ( F `  x ) )   &    |-  ( ph  ->  Q : NN --> dom  S.1 )   &    |-  ( ph  ->  A. n  e.  NN  ( 0 p  o R  <_  ( Q `  n )  /\  ( Q `  n )  o R  <_  ( Q `  ( n  +  1 ) ) ) )   &    |-  ( ph  ->  A. x  e.  RR  ( n  e.  NN  |->  ( ( Q `  n ) `
  x ) )  ~~>  ( G `  x ) )   =>    |-  ( ph  ->  ( S.2 `  ( F  o F  +  G )
 )  =  ( (
 S.2 `  F )  +  ( S.2 `  G ) ) )
 
Theoremitg2add 18946 The  S.2 integral is linear. (Measurability is an essential component of this theorem; otherwise consider the characteristic function of a nonmeasurable set and its complement.) (Contributed by Mario Carneiro, 17-Aug-2014.)
 |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  ( S.2 `  F )  e.  RR )   &    |-  ( ph  ->  G  e. MblFn )   &    |-  ( ph  ->  G : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  (
 S.2 `  G )  e.  RR )   =>    |-  ( ph  ->  ( S.2 `  ( F  o F  +  G )
 )  =  ( (
 S.2 `  F )  +  ( S.2 `  G ) ) )
 
Theoremitg2gt0 18947* If the function  F is strictly positive on a set of positive measure, then the integral of the function is positive. (Contributed by Mario Carneiro, 30-Aug-2014.)
 |-  ( ph  ->  A  e.  dom  vol )   &    |-  ( ph  ->  0  <  ( vol `  A ) )   &    |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  F  e. MblFn )   &    |-  (
 ( ph  /\  x  e.  A )  ->  0  <  ( F `  x ) )   =>    |-  ( ph  ->  0  <  ( S.2 `  F ) )
 
Theoremitg2cnlem1 18948* Lemma for itgcn 19029. (Contributed by Mario Carneiro, 30-Aug-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  (
 S.2 `  F )  e.  RR )   =>    |-  ( ph  ->  sup ( ran  (  n  e.  NN  |->  ( S.2 `  ( x  e.  RR  |->  if ( ( F `
  x )  <_  n ,  ( F `  x ) ,  0 ) ) ) ) ,  RR* ,  <  )  =  ( S.2 `  F ) )
 
Theoremitg2cnlem2 18949* Lemma for itgcn 19029. (Contributed by Mario Carneiro, 31-Aug-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  (
 S.2 `  F )  e.  RR )   &    |-  ( ph  ->  C  e.  RR+ )   &    |-  ( ph  ->  M  e.  NN )   &    |-  ( ph  ->  -.  ( S.2 `  ( x  e.  RR  |->  if ( ( F `  x )  <_  M ,  ( F `  x ) ,  0 ) ) )  <_  ( ( S.2 `  F )  -  ( C  /  2
 ) ) )   =>    |-  ( ph  ->  E. d  e.  RR+  A. u  e.  dom  vol ( ( vol `  u )  <  d  ->  ( S.2 `  ( x  e.  RR  |->  if ( x  e.  u ,  ( F `  x ) ,  0 ) ) )  <  C ) )
 
Theoremitg2cn 18950* A sort of absolute continuity of the Lebesgue integral (this is the core of ftc1a 19216 which is about actual absolute continuity). (Contributed by Mario Carneiro, 1-Sep-2014.)
 |-  ( ph  ->  F : RR --> ( 0 [,)  +oo ) )   &    |-  ( ph  ->  F  e. MblFn )   &    |-  ( ph  ->  (
 S.2 `  F )  e.  RR )   &    |-  ( ph  ->  C  e.  RR+ )   =>    |-  ( ph  ->  E. d  e.  RR+  A. u  e.  dom  vol ( ( vol `  u )  <  d  ->  ( S.2 `  ( x  e. 
 RR  |->  if ( x  e.  u ,  ( F `
  x ) ,  0 ) ) )  <  C ) )
 
Theoremibllem 18951 Conditioned equality theorem for the if statement. (Contributed by Mario Carneiro, 31-Jul-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  =  C )   =>    |-  ( ph  ->  if ( ( x  e.  A  /\  0  <_  B ) ,  B ,  0 )  =  if ( ( x  e.  A  /\  0  <_  C ) ,  C ,  0 ) )
 
Theoremisibl 18952* The predicate " F is integrable". The "integrable" predicate corresponds roughly to the range of validity of  S. A B  _d x, which is to say that the expression  S. A B  _d x doesn't make sense unless  ( x  e.  A  |->  B )  e.  L ^1. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  G  =  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  T ) ,  T ,  0 ) ) )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  T  =  ( Re
 `  ( B  /  ( _i ^ k ) ) ) )   &    |-  ( ph  ->  dom  F  =  A )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  ( F `  x )  =  B )   =>    |-  ( ph  ->  ( F  e.  L ^1  <->  ( F  e. MblFn  /\ 
 A. k  e.  (
 0 ... 3 ) (
 S.2 `  G )  e.  RR ) ) )
 
Theoremisibl2 18953* The predicate " F is integrable" when  F is a mapping operation. (Contributed by Mario Carneiro, 31-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  G  =  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  T ) ,  T ,  0 ) ) )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  T  =  ( Re
 `  ( B  /  ( _i ^ k ) ) ) )   &    |-  (
 ( ph  /\  x  e.  A )  ->  B  e.  V )   =>    |-  ( ph  ->  (
 ( x  e.  A  |->  B )  e.  L ^1 
 <->  ( ( x  e.  A  |->  B )  e. MblFn  /\  A. k  e.  (
 0 ... 3 ) (
 S.2 `  G )  e.  RR ) ) )
 
Theoremiblmbf 18954 An integrable function is measurable. (Contributed by Mario Carneiro, 7-Jul-2014.)
 |-  ( F  e.  L ^1  ->  F  e. MblFn )
 
Theoremiblitg 18955* If a function is integrable, then the  S.2 integrals of the function's decompositions all exist. (Contributed by Mario Carneiro, 7-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  G  =  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  T ) ,  T ,  0 ) ) )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  T  =  ( Re
 `  ( B  /  ( _i ^ K ) ) ) )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   &    |-  (
 ( ph  /\  x  e.  A )  ->  B  e.  V )   =>    |-  ( ( ph  /\  K  e.  ZZ )  ->  ( S.2 `  G )  e. 
 RR )
 
Theoremdfitg 18956* Evaluate the class substitution in df-itg 18811. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  T  =  ( Re
 `  ( B  /  ( _i ^ k ) ) )   =>    |- 
 S. A B  _d x  =  sum_ k  e.  ( 0 ... 3
 ) ( ( _i
 ^ k )  x.  ( S.2 `  ( x  e.  RR  |->  if (
 ( x  e.  A  /\  0  <_  T ) ,  T ,  0 ) ) ) )
 
Theoremitgex 18957 An integral is a set. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |- 
 S. A B  _d x  e.  _V
 
Theoremitgeq1f 18958 Equality theorem for an integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  F/_ x A   &    |-  F/_ x B   =>    |-  ( A  =  B  ->  S. A C  _d x  =  S. B C  _d x )
 
Theoremitgeq1 18959* Equality theorem for an integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( A  =  B  ->  S. A C  _d x  =  S. B C  _d x )
 
Theoremnfitg1 18960 Bound-variable hypothesis builder for an integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  F/_ x S. A B  _d x
 
Theoremnfitg 18961* Bound-variable hypothesis builder for an integral: if  y is (effectively) not free in  A and  B, it is not free in  S. A B  _d x. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  F/_ y A   &    |-  F/_ y B   =>    |-  F/_ y S. A B  _d x
 
Theoremcbvitg 18962* Change bound variable in an integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( x  =  y 
 ->  B  =  C )   &    |-  F/_ y B   &    |-  F/_ x C   =>    |-  S. A B  _d x  =  S. A C  _d y
 
Theoremcbvitgv 18963* Change bound variable in an integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( x  =  y 
 ->  B  =  C )   =>    |-  S. A B  _d x  =  S. A C  _d y
 
Theoremitgeq2 18964 Equality theorem for an integral. (Contributed by Mario Carneiro, 28-Jun-2014.)
 |-  ( A. x  e.  A  B  =  C  ->  S. A B  _d x  =  S. A C  _d x )
 
Theoremitgresr 18965 The domain of an integral only matters in its intersection with  RR. (Contributed by Mario Carneiro, 29-Jun-2014.)
 |- 
 S. A B  _d x  =  S. ( A  i^i  RR ) B  _d x
 
Theoremitg0 18966 The integral of anything on the empty set is zero. (Contributed by Mario Carneiro, 13-Aug-2014.)
 |- 
 S. (/) A  _d x  =  0
 
Theoremitgz 18967 The integral of zero on any set is zero. (Contributed by Mario Carneiro, 29-Jun-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |- 
 S. A 0  _d x  =  0
 
Theoremitgeq2dv 18968* Equality theorem for an integral. (Contributed by Mario Carneiro, 7-Jul-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  =  C )   =>    |-  ( ph  ->  S. A B  _d x  =  S. A C  _d x )
 
Theoremitgmpt 18969* Change bound variable in an integral. (Contributed by Mario Carneiro, 29-Jun-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   =>    |-  ( ph  ->  S. A B  _d x  =  S. A ( ( x  e.  A  |->  B ) `  y )  _d y )
 
Theoremitgcl 18970* The integral of an integrable function is a complex number. (Contributed by Mario Carneiro, 29-Jun-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  S. A B  _d x  e.  CC )
 
Theoremitgvallem 18971* Substitution lemma. (Contributed by Mario Carneiro, 7-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( _i ^ K )  =  T   =>    |-  ( k  =  K  ->  ( S.2 `  ( x  e.  RR  |->  if (
 ( x  e.  A  /\  0  <_  ( Re
 `  ( B  /  ( _i ^ k ) ) ) ) ,  ( Re `  ( B  /  ( _i ^
 k ) ) ) ,  0 ) ) )  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  ( Re `  ( B 
 /  T ) ) ) ,  ( Re
 `  ( B  /  T ) ) ,  0 ) ) ) )
 
Theoremitgvallem3 18972* Lemma for itgposval 18982 and itgreval 18983. (Contributed by Mario Carneiro, 7-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  =  0 )   =>    |-  ( ph  ->  (
 S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  B ) ,  B ,  0 ) ) )  =  0 )
 
Theoremibl0 18973 The zero function is integrable on any measurable set. (Unlike iblconst 19004, this does not require  A to have finite measure.) (Contributed by Mario Carneiro, 23-Aug-2014.)
 |-  ( A  e.  dom  vol 
 ->  ( A  X.  {
 0 } )  e.  L ^1 )
 
Theoremiblcnlem1 18974* Lemma for iblcnlem 18975. (Contributed by Mario Carneiro, 6-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  R  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  ( Re `  B ) ) ,  ( Re
 `  B ) ,  0 ) ) )   &    |-  S  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u ( Re `  B ) ) ,  -u ( Re `  B ) ,  0 ) ) )   &    |-  T  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  ( Im `  B ) ) ,  ( Im
 `  B ) ,  0 ) ) )   &    |-  U  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u ( Im `  B ) ) ,  -u ( Im `  B ) ,  0 ) ) )   &    |-  ( ( ph  /\  x  e.  A )  ->  B  e.  CC )   =>    |-  ( ph  ->  (
 ( x  e.  A  |->  B )  e.  L ^1 
 <->  ( ( x  e.  A  |->  B )  e. MblFn  /\  ( R  e.  RR  /\  S  e.  RR )  /\  ( T  e.  RR  /\  U  e.  RR )
 ) ) )
 
Theoremiblcnlem 18975* Expand out the forall in isibl2 18953. (Contributed by Mario Carneiro, 6-Aug-2014.)
 |-  R  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  ( Re `  B ) ) ,  ( Re
 `  B ) ,  0 ) ) )   &    |-  S  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u ( Re `  B ) ) ,  -u ( Re `  B ) ,  0 ) ) )   &    |-  T  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  ( Im `  B ) ) ,  ( Im
 `  B ) ,  0 ) ) )   &    |-  U  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u ( Im `  B ) ) ,  -u ( Im `  B ) ,  0 ) ) )   &    |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   =>    |-  ( ph  ->  (
 ( x  e.  A  |->  B )  e.  L ^1 
 <->  ( ( x  e.  A  |->  B )  e. MblFn  /\  ( R  e.  RR  /\  S  e.  RR )  /\  ( T  e.  RR  /\  U  e.  RR )
 ) ) )
 
Theoremitgcnlem 18976* Expand out the sum in dfitg 18956. (Contributed by Mario Carneiro, 1-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  R  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  ( Re `  B ) ) ,  ( Re
 `  B ) ,  0 ) ) )   &    |-  S  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u ( Re `  B ) ) ,  -u ( Re `  B ) ,  0 ) ) )   &    |-  T  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  ( Im `  B ) ) ,  ( Im
 `  B ) ,  0 ) ) )   &    |-  U  =  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u ( Im `  B ) ) ,  -u ( Im `  B ) ,  0 ) ) )   &    |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  S. A B  _d x  =  ( ( R  -  S )  +  ( _i  x.  ( T  -  U ) ) ) )
 
Theoremiblrelem 18977* Integrability of a real function. (Contributed by Mario Carneiro, 31-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   =>    |-  ( ph  ->  (
 ( x  e.  A  |->  B )  e.  L ^1 
 <->  ( ( x  e.  A  |->  B )  e. MblFn  /\  ( S.2 `  ( x  e.  RR  |->  if (
 ( x  e.  A  /\  0  <_  B ) ,  B ,  0 ) ) )  e. 
 RR  /\  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u B ) ,  -u B ,  0 ) ) )  e.  RR )
 ) )
 
Theoremiblposlem 18978* Lemma for iblpos 18979. (Contributed by Mario Carneiro, 31-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  0  <_  B )   =>    |-  ( ph  ->  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_  -u B ) ,  -u B ,  0 ) ) )  =  0 )
 
Theoremiblpos 18979* Integrability of a nonnegative function. (Contributed by Mario Carneiro, 31-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  0  <_  B )   =>    |-  ( ph  ->  ( ( x  e.  A  |->  B )  e.  L ^1  <->  ( ( x  e.  A  |->  B )  e. MblFn  /\  ( S.2 `  ( x  e.  RR  |->  if ( x  e.  A ,  B ,  0 )
 ) )  e.  RR ) ) )
 
Theoremiblre 18980* Integrability of a real function. (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   =>    |-  ( ph  ->  (
 ( x  e.  A  |->  B )  e.  L ^1 
 <->  ( ( x  e.  A  |->  if ( 0  <_  B ,  B , 
 0 ) )  e.  L ^1  /\  ( x  e.  A  |->  if (
 0  <_  -u B ,  -u B ,  0 ) )  e.  L ^1 ) ) )
 
Theoremitgrevallem1 18981* Lemma for itgposval 18982 and itgreval 18983. (Contributed by Mario Carneiro, 31-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  S. A B  _d x  =  ( ( S.2 `  ( x  e.  RR  |->  if (
 ( x  e.  A  /\  0  <_  B ) ,  B ,  0 ) ) )  -  ( S.2 `  ( x  e.  RR  |->  if ( ( x  e.  A  /\  0  <_ 
 -u B ) ,  -u B ,  0 ) ) ) ) )
 
Theoremitgposval 18982* The integral of a nonnegative function. (Contributed by Mario Carneiro, 31-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  0  <_  B )   =>    |-  ( ph  ->  S. A B  _d x  =  (
 S.2 `  ( x  e.  RR  |->  if ( x  e.  A ,  B , 
 0 ) ) ) )
 
Theoremitgreval 18983* Decompose the integral of a real function into positive and negative parts. (Contributed by Mario Carneiro, 31-Jul-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  S. A B  _d x  =  ( S. A if ( 0  <_  B ,  B ,  0 )  _d x  -  S. A if ( 0  <_  -u B ,  -u B ,  0 )  _d x ) )
 
Theoremitgrecl 18984* Real closure of an integral. (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  S. A B  _d x  e.  RR )
 
Theoremiblcn 18985* Integrability of a complex function. (Contributed by Mario Carneiro, 6-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  CC )   =>    |-  ( ph  ->  (
 ( x  e.  A  |->  B )  e.  L ^1 
 <->  ( ( x  e.  A  |->  ( Re `  B ) )  e.  L ^1  /\  ( x  e.  A  |->  ( Im
 `  B ) )  e.  L ^1 )
 ) )
 
Theoremitgcnval 18986* Decompose the integral of a complex function into real and imaginary parts. (Contributed by Mario Carneiro, 6-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  S. A B  _d x  =  ( S. A ( Re `  B )  _d x  +  ( _i  x.  S. A ( Im `  B )  _d x ) ) )
 
Theoremitgre 18987* Real part of an integral. (Contributed by Mario Carneiro, 14-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  ( Re `  S. A B  _d x )  =  S. A ( Re `  B )  _d x )
 
Theoremitgim 18988* Imaginary part of an integral. (Contributed by Mario Carneiro, 14-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  ( Im `  S. A B  _d x )  =  S. A ( Im `  B )  _d x )
 
Theoremiblneg 18989* The negative of an integrable function is integrable. (Contributed by Mario Carneiro, 25-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  ( x  e.  A  |->  -u B )  e.  L ^1 )
 
Theoremitgneg 18990* Negation of an integral. (Contributed by Mario Carneiro, 25-Aug-2014.)
 |-  ( ( ph  /\  x  e.  A )  ->  B  e.  V )   &    |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   =>    |-  ( ph  ->  -u S. A B  _d x  =  S. A -u B  _d x )
 
Theoremiblss 18991* A subset of an integrable function is integrable. (Contributed by Mario Carneiro, 12-Aug-2014.)
 |-  ( ph  ->  A  C_  B )   &    |-  ( ph  ->  A  e.  dom  vol )   &    |-  (
 ( ph  /\  x  e.  B )  ->  C  e.  V )   &    |-  ( ph  ->  ( x  e.  B  |->  C )  e.  L ^1 )   =>    |-  ( ph  ->  ( x  e.  A  |->  C )  e.  L ^1 )
 
Theoremiblss2 18992* Change the domain of an integrability predicate. (Contributed by Mario Carneiro, 13-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  A  C_  B )   &    |-  ( ph  ->  B  e.  dom  vol )   &    |-  (
 ( ph  /\  x  e.  A )  ->  C  e.  V )   &    |-  ( ( ph  /\  x  e.  ( B 
 \  A ) ) 
 ->  C  =  0 )   &    |-  ( ph  ->  ( x  e.  A  |->  C )  e.  L ^1 )   =>    |-  ( ph  ->  ( x  e.  B  |->  C )  e.  L ^1 )
 
Theoremitgitg2 18993* Transfer an integral using  S.2 to an equivalent integral using  S.. (Contributed by Mario Carneiro, 6-Aug-2014.)
 |-  ( ( ph  /\  x  e.  RR )  ->  A  e.  RR )   &    |-  ( ( ph  /\  x  e.  RR )  ->  0  <_  A )   &    |-  ( ph  ->  ( x  e. 
 RR  |->  A )  e.  L ^1 )   =>    |-  ( ph  ->  S. RR A  _d x  =  ( S.2 `  ( x  e.  RR  |->  A ) ) )
 
Theoremi1fibl 18994 A simple function is integrable. (Contributed by Mario Carneiro, 6-Aug-2014.)
 |-  ( F  e.  dom  S.1 
 ->  F  e.  L ^1 )
 
Theoremitgitg1 18995* Transfer an integral using  S.1 to an equivalent integral using  S.. (Contributed by Mario Carneiro, 6-Aug-2014.)
 |-  ( F  e.  dom  S.1 
 ->  S. RR ( F `
  x )  _d x  =  ( S.1 `  F ) )
 
Theoremitgle 18996* Monotonicity of an integral. (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   &    |-  ( ph  ->  ( x  e.  A  |->  C )  e.  L ^1 )   &    |-  (
 ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  C  e.  RR )   &    |-  (
 ( ph  /\  x  e.  A )  ->  B  <_  C )   =>    |-  ( ph  ->  S. A B  _d x  <_  S. A C  _d x )
 
Theoremitgge0 18997* The integral of a positive function is positive. (Contributed by Mario Carneiro, 25-Aug-2014.)
 |-  ( ph  ->  ( x  e.  A  |->  B )  e.  L ^1 )   &    |-  (
 ( ph  /\  x  e.  A )  ->  B  e.  RR )   &    |-  ( ( ph  /\  x  e.  A ) 
 ->  0  <_  B )   =>    |-  ( ph  ->  0  <_  S. A B  _d x )
 
Theoremitgss 18998* Expand the set of an integral by adding zeroes outside the domain. (Contributed by Mario Carneiro, 11-Aug-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
 |-  ( ph  ->  A  C_  B )   &    |-  ( ( ph  /\  x  e.  ( B 
 \  A ) ) 
 ->  C  =  0 )   =>    |-  ( ph  ->  S. A C  _d x  =  S. B C  _d x )
 
Theoremitgss2 18999* Expand the set of an integral by adding zeroes outside the domain. (Contributed by Mario Carneiro, 11-Aug-2014.)
 |-  ( A  C_  B  ->  S. A C  _d x  =  S. B if ( x  e.  A ,  C ,  0 )  _d x )
 
Theoremitgeqa 19000* Approximate equality of integrals. If  C ( x )  =  D ( x ) for almost all  x, then  S. B C ( x )  _d x  =  S. B D ( x )  _d x and one is integrable iff the other is. (Contributed by Mario Carneiro, 12-Aug-2014.) (Revised by Mario Carneiro, 2-Sep-2014.)
 |-  ( ( ph  /\  x  e.  B )  ->  C  e.  CC )   &    |-  ( ( ph  /\  x  e.  B ) 
 ->  D  e.  CC )   &    |-  ( ph  ->  A  C_  RR )   &    |-  ( ph  ->  ( vol * `  A )  =  0 )   &    |-  (
 ( ph  /\  x  e.  ( B  \  A ) )  ->  C  =  D )   =>    |-  ( ph  ->  (
 ( ( x  e.  B  |->  C )  e.  L ^1  <->  ( x  e.  B  |->  D )  e.  L ^1 )  /\  S. B C  _d x  =  S. B D  _d x ) )
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31058
  Copyright terms: Public domain < Previous  Next >