| 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 25645 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ) | |
| 2 | xrge0f 25700 | . . . 4 ⊢ ((𝐹:ℝ⟶ℝ ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) | |
| 3 | 1, 2 | sylan 581 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹:ℝ⟶(0[,]+∞)) |
| 4 | itg2cl 25701 | . . 3 ⊢ (𝐹:ℝ⟶(0[,]+∞) → (∫2‘𝐹) ∈ ℝ*) | |
| 5 | 3, 4 | syl 17 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) ∈ ℝ*) |
| 6 | itg1cl 25654 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℝ) | |
| 7 | 6 | adantr 480 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ∈ ℝ) |
| 8 | 7 | rexrd 11194 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ∈ ℝ*) |
| 9 | itg1le 25682 | . . . . . . 7 ⊢ ((𝑔 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1 ∧ 𝑔 ∘r ≤ 𝐹) → (∫1‘𝑔) ≤ (∫1‘𝐹)) | |
| 10 | 9 | 3expia 1122 | . . . . . 6 ⊢ ((𝑔 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1) → (𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 11 | 10 | ancoms 458 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝑔 ∈ dom ∫1) → (𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 12 | 11 | ralrimiva 3130 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 13 | 12 | adantr 480 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹))) |
| 14 | itg2leub 25703 | . . . 4 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (∫1‘𝐹) ∈ ℝ*) → ((∫2‘𝐹) ≤ (∫1‘𝐹) ↔ ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹)))) | |
| 15 | 3, 8, 14 | syl2anc 585 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → ((∫2‘𝐹) ≤ (∫1‘𝐹) ↔ ∀𝑔 ∈ dom ∫1(𝑔 ∘r ≤ 𝐹 → (∫1‘𝑔) ≤ (∫1‘𝐹)))) |
| 16 | 13, 15 | mpbird 257 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) ≤ (∫1‘𝐹)) |
| 17 | simpl 482 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹 ∈ dom ∫1) | |
| 18 | reex 11129 | . . . . . 6 ⊢ ℝ ∈ V | |
| 19 | 18 | a1i 11 | . . . . 5 ⊢ (𝐹 ∈ dom ∫1 → ℝ ∈ V) |
| 20 | leid 11241 | . . . . . 6 ⊢ (𝑥 ∈ ℝ → 𝑥 ≤ 𝑥) | |
| 21 | 20 | adantl 481 | . . . . 5 ⊢ ((𝐹 ∈ dom ∫1 ∧ 𝑥 ∈ ℝ) → 𝑥 ≤ 𝑥) |
| 22 | 19, 1, 21 | caofref 7663 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → 𝐹 ∘r ≤ 𝐹) |
| 23 | 22 | adantr 480 | . . 3 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → 𝐹 ∘r ≤ 𝐹) |
| 24 | itg2ub 25702 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐹 ∈ dom ∫1 ∧ 𝐹 ∘r ≤ 𝐹) → (∫1‘𝐹) ≤ (∫2‘𝐹)) | |
| 25 | 3, 17, 23, 24 | syl3anc 1374 | . 2 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫1‘𝐹) ≤ (∫2‘𝐹)) |
| 26 | 5, 8, 16, 25 | xrletrid 13081 | 1 ⊢ ((𝐹 ∈ dom ∫1 ∧ 0𝑝 ∘r ≤ 𝐹) → (∫2‘𝐹) = (∫1‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 Vcvv 3442 class class class wbr 5100 dom cdm 5632 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ∘r cofr 7631 ℝcr 11037 0cc0 11038 +∞cpnf 11175 ℝ*cxr 11177 ≤ cle 11179 [,]cicc 13276 ∫1citg1 25584 ∫2citg2 25585 0𝑝c0p 25638 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-disj 5068 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-of 7632 df-ofr 7633 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-pm 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-inf 9358 df-oi 9427 df-dju 9825 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-n0 12414 df-z 12501 df-uz 12764 df-q 12874 df-rp 12918 df-xadd 13039 df-ioo 13277 df-ico 13279 df-icc 13280 df-fz 13436 df-fzo 13583 df-fl 13724 df-seq 13937 df-exp 13997 df-hash 14266 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-clim 15423 df-sum 15622 df-xmet 21314 df-met 21315 df-ovol 25433 df-vol 25434 df-mbf 25588 df-itg1 25589 df-itg2 25590 df-0p 25639 |
| This theorem is referenced by: itg20 25706 itg2const 25709 itg2i1fseq 25724 i1fibl 25777 itgitg1 25778 ftc1anclem5 37942 ftc1anclem7 37944 ftc1anclem8 37945 |
| Copyright terms: Public domain | W3C validator |