| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg1lea | Structured version Visualization version GIF version | ||
| Description: Approximate version of itg1le 25909. If 𝐹 ≤ 𝐺 for almost all 𝑥, then ∫1𝐹 ≤ ∫1𝐺. (Contributed by Mario Carneiro, 28-Jun-2014.) (Revised by Mario Carneiro, 6-Aug-2014.) |
| Ref | Expression |
|---|---|
| itg10a.1 | ⊢ (𝜑 → 𝐹 ∈ dom ∫1) |
| itg10a.2 | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
| itg10a.3 | ⊢ (𝜑 → (vol*‘𝐴) = 0) |
| itg1lea.4 | ⊢ (𝜑 → 𝐺 ∈ dom ∫1) |
| itg1lea.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ≤ (𝐺‘𝑥)) |
| Ref | Expression |
|---|---|
| itg1lea | ⊢ (𝜑 → (∫1‘𝐹) ≤ (∫1‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | itg1lea.4 | . . . . 5 ⊢ (𝜑 → 𝐺 ∈ dom ∫1) | |
| 2 | itg10a.1 | . . . . 5 ⊢ (𝜑 → 𝐹 ∈ dom ∫1) | |
| 3 | i1fsub 25904 | . . . . 5 ⊢ ((𝐺 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1) → (𝐺 ∘f − 𝐹) ∈ dom ∫1) | |
| 4 | 1, 2, 3 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝐺 ∘f − 𝐹) ∈ dom ∫1) |
| 5 | itg10a.2 | . . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 6 | itg10a.3 | . . . 4 ⊢ (𝜑 → (vol*‘𝐴) = 0) | |
| 7 | itg1lea.5 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ≤ (𝐺‘𝑥)) | |
| 8 | eldifi 4088 | . . . . . . 7 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → 𝑥 ∈ ℝ) | |
| 9 | i1ff 25872 | . . . . . . . . . 10 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℝ) | |
| 10 | 1, 9 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝐺:ℝ⟶ℝ) |
| 11 | 10 | ffvelcdmda 7086 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐺‘𝑥) ∈ ℝ) |
| 12 | i1ff 25872 | . . . . . . . . . 10 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ) | |
| 13 | 2, 12 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ) |
| 14 | 13 | ffvelcdmda 7086 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) ∈ ℝ) |
| 15 | 11, 14 | subge0d 11822 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (0 ≤ ((𝐺‘𝑥) − (𝐹‘𝑥)) ↔ (𝐹‘𝑥) ≤ (𝐺‘𝑥))) |
| 16 | 8, 15 | sylan2 605 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (0 ≤ ((𝐺‘𝑥) − (𝐹‘𝑥)) ↔ (𝐹‘𝑥) ≤ (𝐺‘𝑥))) |
| 17 | 7, 16 | mpbird 260 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → 0 ≤ ((𝐺‘𝑥) − (𝐹‘𝑥))) |
| 18 | 10 | ffnd 6713 | . . . . . . 7 ⊢ (𝜑 → 𝐺 Fn ℝ) |
| 19 | 13 | ffnd 6713 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn ℝ) |
| 20 | reex 11209 | . . . . . . . 8 ⊢ ℝ ∈ V | |
| 21 | 20 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → ℝ ∈ V) |
| 22 | inidm 4182 | . . . . . . 7 ⊢ (ℝ ∩ ℝ) = ℝ | |
| 23 | eqidd 2767 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 24 | eqidd 2767 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 25 | 18, 19, 21, 21, 22, 23, 24 | ofval 7698 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ((𝐺 ∘f − 𝐹)‘𝑥) = ((𝐺‘𝑥) − (𝐹‘𝑥))) |
| 26 | 8, 25 | sylan2 605 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ((𝐺 ∘f − 𝐹)‘𝑥) = ((𝐺‘𝑥) − (𝐹‘𝑥))) |
| 27 | 17, 26 | breqtrrd 5144 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → 0 ≤ ((𝐺 ∘f − 𝐹)‘𝑥)) |
| 28 | 4, 5, 6, 27 | itg1ge0a 25907 | . . 3 ⊢ (𝜑 → 0 ≤ (∫1‘(𝐺 ∘f − 𝐹))) |
| 29 | itg1sub 25905 | . . . 4 ⊢ ((𝐺 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1) → (∫1‘(𝐺 ∘f − 𝐹)) = ((∫1‘𝐺) − (∫1‘𝐹))) | |
| 30 | 1, 2, 29 | syl2anc 596 | . . 3 ⊢ (𝜑 → (∫1‘(𝐺 ∘f − 𝐹)) = ((∫1‘𝐺) − (∫1‘𝐹))) |
| 31 | 28, 30 | breqtrd 5142 | . 2 ⊢ (𝜑 → 0 ≤ ((∫1‘𝐺) − (∫1‘𝐹))) |
| 32 | itg1cl 25881 | . . . 4 ⊢ (𝐺 ∈ dom ∫1 → (∫1‘𝐺) ∈ ℝ) | |
| 33 | 1, 32 | syl 18 | . . 3 ⊢ (𝜑 → (∫1‘𝐺) ∈ ℝ) |
| 34 | itg1cl 25881 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℝ) | |
| 35 | 2, 34 | syl 18 | . . 3 ⊢ (𝜑 → (∫1‘𝐹) ∈ ℝ) |
| 36 | 33, 35 | subge0d 11822 | . 2 ⊢ (𝜑 → (0 ≤ ((∫1‘𝐺) − (∫1‘𝐹)) ↔ (∫1‘𝐹) ≤ (∫1‘𝐺))) |
| 37 | 31, 36 | mpbid 235 | 1 ⊢ (𝜑 → (∫1‘𝐹) ≤ (∫1‘𝐺)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 Vcvv 3458 ∖ cdif 3905 ⊆ wss 3908 class class class wbr 5114 dom cdm 5666 ⟶wf 6539 ‘cfv 6543 (class class class)co 7423 ∘f cof 7685 ℝcr 11117 0cc0 11118 ≤ cle 11262 − cmin 11459 vol*covol 25658 ∫1citg1 25811 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-inf2 9620 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 ax-pre-sup 11196 ax-addf 11197 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-int 4918 df-iun 4963 df-disj 5082 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-se 5620 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-of 7687 df-om 7872 df-1st 7995 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8703 df-map 8835 df-pm 8836 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-sup 9412 df-inf 9413 df-oi 9482 df-dju 9906 df-card 9944 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-3 12322 df-n0 12523 df-z 12610 df-uz 12881 df-q 12991 df-rp 13035 df-xadd 13156 df-ioo 13394 df-ico 13396 df-icc 13397 df-fz 13554 df-fzo 13702 df-fl 13845 df-seq 14058 df-exp 14118 df-hash 14387 df-cj 15176 df-re 15177 df-im 15178 df-sqrt 15312 df-abs 15313 df-clim 15565 df-sum 15764 df-xmet 21552 df-met 21553 df-ovol 25660 df-vol 25661 df-mbf 25815 df-itg1 25816 |
| This theorem is used by: itg1le 25909 itg2uba 25939 itg2splitlem 25944 |
| Copyright terms: Public domain | W3C validator |