| 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 25796 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ) | |
| 2 | xrge0f 25851 | . . . 4 ⊢ ((𝐹:ℝ⟶ℝ ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) | |
| 3 | 1, 2 | sylan 591 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) |
| 4 | itg2cl 25852 | . . 3 ⊢ (𝐹:ℝ⟶(0[,]+∞) → (∫2‘𝐹) ∈ ℝ*) | |
| 5 | 3, 4 | syl 18 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) ∈ ℝ*) |
| 6 | itg1cl 25805 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℝ) | |
| 7 | 6 | adantr 485 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ∈ ℝ) |
| 8 | 7 | rexrd 11247 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ∈ ℝ*) |
| 9 | itg1le 25833 | . . . . . . 7 ⊢ ((𝑔 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1 ∧ 𝑔 ∘r ≤ 𝐹) → (∫1‘𝑔) ≤ (∫1‘𝐹)) | |
| 10 | 9 | 3expia 1137 | . . . . . 6 ⊢ ((𝑔 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1) → (𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 11 | 10 | ancoms 463 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝑔 ∈ dom ∫1) → (𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 12 | 11 | ralrimiva 3157 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 13 | 12 | adantr 485 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 14 | itg2leub 25854 | . . . 4 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (∫1‘𝐹) ∈ ℝ*) → ((∫2‘𝐹) ≤ (∫1‘𝐹) ↔ ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹)))) | |
| 15 | 3, 8, 14 | syl2anc 595 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → ((∫2‘𝐹) ≤ (∫1‘𝐹) ↔ ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹)))) |
| 16 | 13, 15 | mpbird 260 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) ≤ (∫1‘𝐹)) |
| 17 | simpl 487 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹 ∈ dom ∫1) | |
| 18 | reex 11179 | . . . . . 6 ⊢ ℝ ∈ V | |
| 19 | 18 | a1i 11 | . . . . 5 ⊢ (𝐹 ∈ dom ∫1 → ℝ ∈ V) |
| 20 | leid 11294 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → 𝑥 ≤ 𝑥) | |
| 21 | 20 | adantl 486 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ 𝑥) |
| 22 | 19, 1, 21 | caofref 7695 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹 ∘r ≤ 𝐹) |
| 23 | 22 | adantr 485 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹 ∘r ≤ 𝐹) |
| 24 | itg2ub 25853 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐹 ∈ dom ∫1 ∧ 𝐹 ∘r ≤ 𝐹) → (∫1‘𝐹) ≤ (∫2‘𝐹)) | |
| 25 | 3, 17, 23, 24 | syl3anc 1394 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ≤ (∫2‘𝐹)) |
| 26 | 5, 8, 16, 25 | xrletrid 13171 | 1 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) = (∫1‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ∀wral 3079 Vcvv 3457 class class class wbr 5105 dom cdm 5652 ⟶wf 6521 ‘cfv 6525 (class class class)co 7400 ∘r cofr 7663 ℝcr 11087 0cc0 11088 +∞cpnf 11228 ℝ*cxr 11230 ≤ cle 11232 [,]cicc 13366 ∫1citg1 25735 ∫2citg2 25736 0𝑝c0p 25789 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5232 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-inf2 9598 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-mulrcl 11151 ax-mulcom 11152 ax-addass 11153 ax-mulass 11154 ax-distr 11155 ax-i2m1 11156 ax-1ne0 11157 ax-1rid 11158 ax-rnegex 11159 ax-rrecex 11160 ax-cnre 11161 ax-pre-lttri 11162 ax-pre-lttrn 11163 ax-pre-ltadd 11164 ax-pre-mulgt0 11165 ax-pre-sup 11166 ax-addf 11167 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-pss 3927 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-int 4909 df-iun 4954 df-disj 5073 df-br 5106 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5547 df-eprel 5552 df-po 5560 df-so 5561 df-fr 5605 df-se 5606 df-we 5607 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-pred 6292 df-ord 6353 df-on 6354 df-lim 6355 df-suc 6356 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-isom 6534 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-of 7664 df-ofr 7665 df-om 7851 df-1st 7974 df-2nd 7975 df-frecs 8266 df-wrecs 8297 df-recs 8346 df-rdg 8385 df-1o 8441 df-2o 8442 df-er 8682 df-map 8814 df-pm 8815 df-en 8932 df-dom 8933 df-sdom 8934 df-fin 8935 df-sup 9390 df-inf 9391 df-oi 9460 df-dju 9875 df-card 9913 df-pnf 11233 df-mnf 11234 df-xr 11235 df-ltxr 11236 df-le 11237 df-sub 11431 df-neg 11432 df-div 11860 df-nn 12225 df-2 12294 df-3 12295 df-n0 12496 df-z 12583 df-uz 12854 df-q 12964 df-rp 13008 df-xadd 13129 df-ioo 13367 df-ico 13369 df-icc 13370 df-fz 13527 df-fzo 13674 df-fl 13816 df-seq 14029 df-exp 14089 df-hash 14358 df-cj 15140 df-re 15141 df-im 15142 df-sqrt 15276 df-abs 15277 df-clim 15529 df-sum 15728 df-xmet 21475 df-met 21476 df-ovol 25584 df-vol 25585 df-mbf 25739 df-itg1 25740 df-itg2 25741 df-0p 25790 |
| This theorem is referenced by: itg20 25857 itg2const 25860 itg2i1fseq 25875 i1fibl 25928 itgitg1 25929 ftc1anclem5 38208 ftc1anclem7 38210 ftc1anclem8 38211 |
| Copyright terms: Public domain | W3C validator |