| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg2lea | Structured version Visualization version GIF version | ||
| Description: Approximate version of itg2le 25647. If 𝐹 ≤ 𝐺 for almost all 𝑥, then ∫2𝐹 ≤ ∫2𝐺. (Contributed by Mario Carneiro, 11-Aug-2014.) |
| Ref | Expression |
|---|---|
| itg2lea.1 | ⊢ (𝜑 → 𝐹:ℝ⟶(0[,]+∞)) |
| itg2lea.2 | ⊢ (𝜑 → 𝐺:ℝ⟶(0[,]+∞)) |
| itg2lea.3 | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| itg2lea.4 | ⊢ (𝜑 → (vol*‘𝐴) = 0) |
| itg2lea.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ≤ (𝐺‘𝑥)) |
| Ref | Expression |
|---|---|
| itg2lea | ⊢ (𝜑 → (∫2‘𝐹) ≤ (∫2‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | itg2lea.2 | . . . . . 6 ⊢ (𝜑 → 𝐺:ℝ⟶(0[,]+∞)) | |
| 2 | 1 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐺:ℝ⟶(0[,]+∞)) |
| 3 | simprl 770 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓 ∈ dom ∫1) | |
| 4 | itg2lea.3 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 5 | 4 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐴 ⊆ ℝ) |
| 6 | itg2lea.4 | . . . . . 6 ⊢ (𝜑 → (vol*‘𝐴) = 0) | |
| 7 | 6 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → (vol*‘𝐴) = 0) |
| 8 | i1ff 25584 | . . . . . . . . 9 ⊢ (𝑓 ∈ dom ∫1 → 𝑓:ℝ⟶ℝ) | |
| 9 | 8 | ad2antrl 728 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓:ℝ⟶ℝ) |
| 10 | eldifi 4097 | . . . . . . . 8 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → 𝑥 ∈ ℝ) | |
| 11 | ffvelcdm 7056 | . . . . . . . 8 ⊢ ((𝑓:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → (𝑓‘𝑥) ∈ ℝ) | |
| 12 | 9, 10, 11 | syl2an 596 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ∈ ℝ) |
| 13 | 12 | rexrd 11231 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ∈ ℝ*) |
| 14 | iccssxr 13398 | . . . . . . 7 ⊢ (0[,]+∞) ⊆ ℝ* | |
| 15 | itg2lea.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℝ⟶(0[,]+∞)) | |
| 16 | 15 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐹:ℝ⟶(0[,]+∞)) |
| 17 | ffvelcdm 7056 | . . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) ∈ (0[,]+∞)) | |
| 18 | 16, 10, 17 | syl2an 596 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ∈ (0[,]+∞)) |
| 19 | 14, 18 | sselid 3947 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ∈ ℝ*) |
| 20 | ffvelcdm 7056 | . . . . . . . 8 ⊢ ((𝐺:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (𝐺‘𝑥) ∈ (0[,]+∞)) | |
| 21 | 2, 10, 20 | syl2an 596 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐺‘𝑥) ∈ (0[,]+∞)) |
| 22 | 14, 21 | sselid 3947 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐺‘𝑥) ∈ ℝ*) |
| 23 | simprr 772 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓 ∘r ≤ 𝐹) | |
| 24 | 9 | ffnd 6692 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓 Fn ℝ) |
| 25 | 16 | ffnd 6692 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐹 Fn ℝ) |
| 26 | reex 11166 | . . . . . . . . . . 11 ⊢ ℝ ∈ V | |
| 27 | 26 | a1i 11 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → ℝ ∈ V) |
| 28 | inidm 4193 | . . . . . . . . . 10 ⊢ (ℝ ∩ ℝ) = ℝ | |
| 29 | eqidd 2731 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ ℝ) → (𝑓‘𝑥) = (𝑓‘𝑥)) | |
| 30 | eqidd 2731 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 31 | 24, 25, 27, 27, 28, 29, 30 | ofrfval 7666 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → (𝑓 ∘r ≤ 𝐹 ↔ ∀𝑥 ∈ ℝ (𝑓‘𝑥) ≤ (𝐹‘𝑥))) |
| 32 | 23, 31 | mpbid 232 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → ∀𝑥 ∈ ℝ (𝑓‘𝑥) ≤ (𝐹‘𝑥)) |
| 33 | 32 | r19.21bi 3230 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ ℝ) → (𝑓‘𝑥) ≤ (𝐹‘𝑥)) |
| 34 | 10, 33 | sylan2 593 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ≤ (𝐹‘𝑥)) |
| 35 | itg2lea.5 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ≤ (𝐺‘𝑥)) | |
| 36 | 35 | adantlr 715 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ≤ (𝐺‘𝑥)) |
| 37 | 13, 19, 22, 34, 36 | xrletrd 13129 | . . . . 5 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ≤ (𝐺‘𝑥)) |
| 38 | 2, 3, 5, 7, 37 | itg2uba 25651 | . . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → (∫1‘𝑓) ≤ (∫2‘𝐺)) |
| 39 | 38 | expr 456 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ dom ∫1) → (𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺))) |
| 40 | 39 | ralrimiva 3126 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺))) |
| 41 | itg2cl 25640 | . . . 4 ⊢ (𝐺:ℝ⟶(0[,]+∞) → (∫2‘𝐺) ∈ ℝ*) | |
| 42 | 1, 41 | syl 17 | . . 3 ⊢ (𝜑 → (∫2‘𝐺) ∈ ℝ*) |
| 43 | itg2leub 25642 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (∫2‘𝐺) ∈ ℝ*) → ((∫2‘𝐹) ≤ (∫2‘𝐺) ↔ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺)))) | |
| 44 | 15, 42, 43 | syl2anc 584 | . 2 ⊢ (𝜑 → ((∫2‘𝐹) ≤ (∫2‘𝐺) ↔ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺)))) |
| 45 | 40, 44 | mpbird 257 | 1 ⊢ (𝜑 → (∫2‘𝐹) ≤ (∫2‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3045 Vcvv 3450 ∖ cdif 3914 ⊆ wss 3917 class class class wbr 5110 dom cdm 5641 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 ∘r cofr 7655 ℝcr 11074 0cc0 11075 +∞cpnf 11212 ℝ*cxr 11214 ≤ cle 11216 [,]cicc 13316 vol*covol 25370 ∫1citg1 25523 ∫2citg2 25524 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-inf2 9601 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153 ax-addf 11154 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-disj 5078 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-se 5595 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-isom 6523 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-of 7656 df-ofr 7657 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-2o 8438 df-er 8674 df-map 8804 df-pm 8805 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-fi 9369 df-sup 9400 df-inf 9401 df-oi 9470 df-dju 9861 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-nn 12194 df-2 12256 df-3 12257 df-n0 12450 df-z 12537 df-uz 12801 df-q 12915 df-rp 12959 df-xneg 13079 df-xadd 13080 df-xmul 13081 df-ioo 13317 df-ico 13319 df-icc 13320 df-fz 13476 df-fzo 13623 df-fl 13761 df-seq 13974 df-exp 14034 df-hash 14303 df-cj 15072 df-re 15073 df-im 15074 df-sqrt 15208 df-abs 15209 df-clim 15461 df-sum 15660 df-rest 17392 df-topgen 17413 df-psmet 21263 df-xmet 21264 df-met 21265 df-bl 21266 df-mopn 21267 df-top 22788 df-topon 22805 df-bases 22840 df-cmp 23281 df-ovol 25372 df-vol 25373 df-mbf 25527 df-itg1 25528 df-itg2 25529 |
| This theorem is referenced by: itg2eqa 25653 |
| Copyright terms: Public domain | W3C validator |