Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > itg2le | Structured version Visualization version GIF version |
Description: If one function dominates another, then the integral of the larger is also larger. (Contributed by Mario Carneiro, 28-Jun-2014.) |
Ref | Expression |
---|---|
itg2le | ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞) ∧ 𝐹 ∘r ≤ 𝐺) → (∫2‘𝐹) ≤ (∫2‘𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reex 10616 | . . . . . . . . . 10 ⊢ ℝ ∈ V | |
2 | 1 | a1i 11 | . . . . . . . . 9 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → ℝ ∈ V) |
3 | i1ff 24204 | . . . . . . . . . . 11 ⊢ (ℎ ∈ dom ∫1 → ℎ:ℝ⟶ℝ) | |
4 | 3 | adantl 482 | . . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → ℎ:ℝ⟶ℝ) |
5 | ressxr 10673 | . . . . . . . . . 10 ⊢ ℝ ⊆ ℝ* | |
6 | fss 6520 | . . . . . . . . . 10 ⊢ ((ℎ:ℝ⟶ℝ ∧ ℝ ⊆ ℝ*) → ℎ:ℝ⟶ℝ*) | |
7 | 4, 5, 6 | sylancl 586 | . . . . . . . . 9 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → ℎ:ℝ⟶ℝ*) |
8 | simpll 763 | . . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → 𝐹:ℝ⟶(0[,]+∞)) | |
9 | iccssxr 12807 | . . . . . . . . . 10 ⊢ (0[,]+∞) ⊆ ℝ* | |
10 | fss 6520 | . . . . . . . . . 10 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (0[,]+∞) ⊆ ℝ*) → 𝐹:ℝ⟶ℝ*) | |
11 | 8, 9, 10 | sylancl 586 | . . . . . . . . 9 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → 𝐹:ℝ⟶ℝ*) |
12 | simplr 765 | . . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → 𝐺:ℝ⟶(0[,]+∞)) | |
13 | fss 6520 | . . . . . . . . . 10 ⊢ ((𝐺:ℝ⟶(0[,]+∞) ∧ (0[,]+∞) ⊆ ℝ*) → 𝐺:ℝ⟶ℝ*) | |
14 | 12, 9, 13 | sylancl 586 | . . . . . . . . 9 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → 𝐺:ℝ⟶ℝ*) |
15 | xrletr 12539 | . . . . . . . . . 10 ⊢ ((𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ* ∧ 𝑧 ∈ ℝ*) → ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧)) | |
16 | 15 | adantl 482 | . . . . . . . . 9 ⊢ ((((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) ∧ (𝑥 ∈ ℝ* ∧ 𝑦 ∈ ℝ* ∧ 𝑧 ∈ ℝ*)) → ((𝑥 ≤ 𝑦 ∧ 𝑦 ≤ 𝑧) → 𝑥 ≤ 𝑧)) |
17 | 2, 7, 11, 14, 16 | caoftrn 7433 | . . . . . . . 8 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → ((ℎ ∘r ≤ 𝐹 ∧ 𝐹 ∘r ≤ 𝐺) → ℎ ∘r ≤ 𝐺)) |
18 | simplr 765 | . . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ (ℎ ∈ dom ∫1 ∧ ℎ ∘r ≤ 𝐺)) → 𝐺:ℝ⟶(0[,]+∞)) | |
19 | simprl 767 | . . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ (ℎ ∈ dom ∫1 ∧ ℎ ∘r ≤ 𝐺)) → ℎ ∈ dom ∫1) | |
20 | simprr 769 | . . . . . . . . . 10 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ (ℎ ∈ dom ∫1 ∧ ℎ ∘r ≤ 𝐺)) → ℎ ∘r ≤ 𝐺) | |
21 | itg2ub 24261 | . . . . . . . . . 10 ⊢ ((𝐺:ℝ⟶(0[,]+∞) ∧ ℎ ∈ dom ∫1 ∧ ℎ ∘r ≤ 𝐺) → (∫1‘ℎ) ≤ (∫2‘𝐺)) | |
22 | 18, 19, 20, 21 | syl3anc 1363 | . . . . . . . . 9 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ (ℎ ∈ dom ∫1 ∧ ℎ ∘r ≤ 𝐺)) → (∫1‘ℎ) ≤ (∫2‘𝐺)) |
23 | 22 | expr 457 | . . . . . . . 8 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → (ℎ ∘r ≤ 𝐺 → (∫1‘ℎ) ≤ (∫2‘𝐺))) |
24 | 17, 23 | syld 47 | . . . . . . 7 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → ((ℎ ∘r ≤ 𝐹 ∧ 𝐹 ∘r ≤ 𝐺) → (∫1‘ℎ) ≤ (∫2‘𝐺))) |
25 | 24 | ancomsd 466 | . . . . . 6 ⊢ (((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) ∧ ℎ ∈ dom ∫1) → ((𝐹 ∘r ≤ 𝐺 ∧ ℎ ∘r ≤ 𝐹) → (∫1‘ℎ) ≤ (∫2‘𝐺))) |
26 | 25 | exp4b 431 | . . . . 5 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) → (ℎ ∈ dom ∫1 → (𝐹 ∘r ≤ 𝐺 → (ℎ ∘r ≤ 𝐹 → (∫1‘ℎ) ≤ (∫2‘𝐺))))) |
27 | 26 | com23 86 | . . . 4 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞)) → (𝐹 ∘r ≤ 𝐺 → (ℎ ∈ dom ∫1 → (ℎ ∘r ≤ 𝐹 → (∫1‘ℎ) ≤ (∫2‘𝐺))))) |
28 | 27 | 3impia 1109 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞) ∧ 𝐹 ∘r ≤ 𝐺) → (ℎ ∈ dom ∫1 → (ℎ ∘r ≤ 𝐹 → (∫1‘ℎ) ≤ (∫2‘𝐺)))) |
29 | 28 | ralrimiv 3178 | . 2 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞) ∧ 𝐹 ∘r ≤ 𝐺) → ∀ℎ ∈ dom ∫1(ℎ ∘r ≤ 𝐹 → (∫1‘ℎ) ≤ (∫2‘𝐺))) |
30 | simp1 1128 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞) ∧ 𝐹 ∘r ≤ 𝐺) → 𝐹:ℝ⟶(0[,]+∞)) | |
31 | itg2cl 24260 | . . . 4 ⊢ (𝐺:ℝ⟶(0[,]+∞) → (∫2‘𝐺) ∈ ℝ*) | |
32 | 31 | 3ad2ant2 1126 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞) ∧ 𝐹 ∘r ≤ 𝐺) → (∫2‘𝐺) ∈ ℝ*) |
33 | itg2leub 24262 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (∫2‘𝐺) ∈ ℝ*) → ((∫2‘𝐹) ≤ (∫2‘𝐺) ↔ ∀ℎ ∈ dom ∫1(ℎ ∘r ≤ 𝐹 → (∫1‘ℎ) ≤ (∫2‘𝐺)))) | |
34 | 30, 32, 33 | syl2anc 584 | . 2 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞) ∧ 𝐹 ∘r ≤ 𝐺) → ((∫2‘𝐹) ≤ (∫2‘𝐺) ↔ ∀ℎ ∈ dom ∫1(ℎ ∘r ≤ 𝐹 → (∫1‘ℎ) ≤ (∫2‘𝐺)))) |
35 | 29, 34 | mpbird 258 | 1 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝐺:ℝ⟶(0[,]+∞) ∧ 𝐹 ∘r ≤ 𝐺) → (∫2‘𝐹) ≤ (∫2‘𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1079 ∈ wcel 2105 ∀wral 3135 Vcvv 3492 ⊆ wss 3933 class class class wbr 5057 dom cdm 5548 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 ∘r cofr 7397 ℝcr 10524 0cc0 10525 +∞cpnf 10660 ℝ*cxr 10662 ≤ cle 10664 [,]cicc 12729 ∫1citg1 24143 ∫2citg2 24144 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-of 7398 df-ofr 7399 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-oadd 8095 df-er 8278 df-map 8397 df-pm 8398 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-sup 8894 df-inf 8895 df-oi 8962 df-dju 9318 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-n0 11886 df-z 11970 df-uz 12232 df-q 12337 df-rp 12378 df-xadd 12496 df-ioo 12730 df-ico 12732 df-icc 12733 df-fz 12881 df-fzo 13022 df-fl 13150 df-seq 13358 df-exp 13418 df-hash 13679 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-clim 14833 df-sum 15031 df-xmet 20466 df-met 20467 df-ovol 23992 df-vol 23993 df-mbf 24147 df-itg1 24148 df-itg2 24149 |
This theorem is referenced by: itg2const2 24269 itg2monolem1 24278 itg2mono 24281 itg2gt0 24288 itg2cnlem2 24290 iblss 24332 itgle 24337 ibladdlem 24347 iblabs 24356 iblabsr 24357 iblmulc2 24358 bddmulibl 24366 itg2gt0cn 34828 ibladdnclem 34829 iblabsnc 34837 iblmulc2nc 34838 bddiblnc 34843 ftc1anclem4 34851 ftc1anclem6 34853 ftc1anclem7 34854 ftc1anclem8 34855 ftc1anc 34856 |
Copyright terms: Public domain | W3C validator |