| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg2itg1 | Structured version Visualization version GIF version | ||
| Description: The integral of a nonnegative simple function using ∫2 is the same as its value under ∫1. (Contributed by Mario Carneiro, 28-Jun-2014.) |
| Ref | Expression |
|---|---|
| itg2itg1 | ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) = (∫1‘𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | i1ff 25718 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ) | |
| 2 | xrge0f 25773 | . . . 4 ⊢ ((𝐹:ℝ⟶ℝ ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) | |
| 3 | 1, 2 | sylan 589 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) |
| 4 | itg2cl 25774 | . . 3 ⊢ (𝐹:ℝ⟶(0[,]+∞) → (∫2‘𝐹) ∈ ℝ*) | |
| 5 | 3, 4 | syl 17 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) ∈ ℝ*) |
| 6 | itg1cl 25727 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℝ) | |
| 7 | 6 | adantr 484 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ∈ ℝ) |
| 8 | 7 | rexrd 11229 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ∈ ℝ*) |
| 9 | itg1le 25755 | . . . . . . 7 ⊢ ((𝑔 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1 ∧ 𝑔 ∘r ≤ 𝐹) → (∫1‘𝑔) ≤ (∫1‘𝐹)) | |
| 10 | 9 | 3expia 1133 | . . . . . 6 ⊢ ((𝑔 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1) → (𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 11 | 10 | ancoms 462 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝑔 ∈ dom ∫1) → (𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 12 | 11 | ralrimiva 3153 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 13 | 12 | adantr 484 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 14 | itg2leub 25776 | . . . 4 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (∫1‘𝐹) ∈ ℝ*) → ((∫2‘𝐹) ≤ (∫1‘𝐹) ↔ ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹)))) | |
| 15 | 3, 8, 14 | syl2anc 593 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → ((∫2‘𝐹) ≤ (∫1‘𝐹) ↔ ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹)))) |
| 16 | 13, 15 | mpbird 259 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) ≤ (∫1‘𝐹)) |
| 17 | simpl 486 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹 ∈ dom ∫1) | |
| 18 | reex 11161 | . . . . . 6 ⊢ ℝ ∈ V | |
| 19 | 18 | a1i 11 | . . . . 5 ⊢ (𝐹 ∈ dom ∫1 → ℝ ∈ V) |
| 20 | leid 11276 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → 𝑥 ≤ 𝑥) | |
| 21 | 20 | adantl 485 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ 𝑥) |
| 22 | 19, 1, 21 | caofref 7687 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹 ∘r ≤ 𝐹) |
| 23 | 22 | adantr 484 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹 ∘r ≤ 𝐹) |
| 24 | itg2ub 25775 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐹 ∈ dom ∫1 ∧ 𝐹 ∘r ≤ 𝐹) → (∫1‘𝐹) ≤ (∫2‘𝐹)) | |
| 25 | 3, 17, 23, 24 | syl3anc 1389 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ≤ (∫2‘𝐹)) |
| 26 | 5, 8, 16, 25 | xrletrid 13154 | 1 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) = (∫1‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∀wral 3075 Vcvv 3453 class class class wbr 5099 dom cdm 5645 ⟶wf 6513 ‘cfv 6517 (class class class)co 7392 ∘r cofr 7655 ℝcr 11069 0cc0 11070 +∞cpnf 11210 ℝ*cxr 11212 ≤ cle 11214 [,]cicc 13349 ∫1citg1 25657 ∫2citg2 25658 0𝑝c0p 25711 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 ax-inf2 9593 ax-cnex 11126 ax-resscn 11127 ax-1cn 11128 ax-icn 11129 ax-addcl 11130 ax-addrcl 11131 ax-mulcl 11132 ax-mulrcl 11133 ax-mulcom 11134 ax-addass 11135 ax-mulass 11136 ax-distr 11137 ax-i2m1 11138 ax-1ne0 11139 ax-1rid 11140 ax-rnegex 11141 ax-rrecex 11142 ax-cnre 11143 ax-pre-lttri 11144 ax-pre-lttrn 11145 ax-pre-ltadd 11146 ax-pre-mulgt0 11147 ax-pre-sup 11148 ax-addf 11149 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4905 df-iun 4950 df-disj 5067 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5540 df-eprel 5545 df-po 5553 df-so 5554 df-fr 5598 df-se 5599 df-we 5600 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-pred 6284 df-ord 6345 df-on 6346 df-lim 6347 df-suc 6348 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-isom 6526 df-riota 7349 df-ov 7395 df-oprab 7396 df-mpo 7397 df-of 7656 df-ofr 7657 df-om 7843 df-1st 7966 df-2nd 7967 df-frecs 8257 df-wrecs 8288 df-recs 8337 df-rdg 8376 df-1o 8432 df-2o 8433 df-er 8673 df-map 8805 df-pm 8806 df-en 8924 df-dom 8925 df-sdom 8926 df-fin 8927 df-sup 9385 df-inf 9386 df-oi 9455 df-dju 9856 df-card 9894 df-pnf 11215 df-mnf 11216 df-xr 11217 df-ltxr 11218 df-le 11219 df-sub 11413 df-neg 11414 df-div 11842 df-nn 12208 df-2 12277 df-3 12278 df-n0 12479 df-z 12566 df-uz 12837 df-q 12947 df-rp 12991 df-xadd 13112 df-ioo 13350 df-ico 13352 df-icc 13353 df-fz 13510 df-fzo 13657 df-fl 13799 df-seq 14012 df-exp 14072 df-hash 14341 df-cj 15109 df-re 15110 df-im 15111 df-sqrt 15245 df-abs 15246 df-clim 15498 df-sum 15697 df-xmet 21397 df-met 21398 df-ovol 25506 df-vol 25507 df-mbf 25661 df-itg1 25662 df-itg2 25663 df-0p 25712 |
| This theorem is referenced by: itg20 25779 itg2const 25782 itg2i1fseq 25797 i1fibl 25850 itgitg1 25851 ftc1anclem5 38160 ftc1anclem7 38162 ftc1anclem8 38163 |
| Copyright terms: Public domain | W3C validator |