| 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 26014. 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 26009 | . . . . 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 4078 | . . . . . . 7 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → 𝑥 ∈ ℝ) | |
| 9 | i1ff 25977 | . . . . . . . . . 10 ⊢ (𝐺 ∈ dom ∫1 → 𝐺:ℝ⟶ℝ) | |
| 10 | 1, 9 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝐺:ℝ⟶ℝ) |
| 11 | 10 | ffvelcdmda 7076 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐺‘𝑥) ∈ ℝ) |
| 12 | i1ff 25977 | . . . . . . . . . 10 ⊢ (𝐹 ∈ dom ∫1 → 𝐹:ℝ⟶ℝ) | |
| 13 | 2, 12 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℝ⟶ℝ) |
| 14 | 13 | ffvelcdmda 7076 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) ∈ ℝ) |
| 15 | 11, 14 | subge0d 11887 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (0 ≤ ((𝐺‘𝑥) − (𝐹‘𝑥)) ↔ (𝐹‘𝑥) ≤ (𝐺‘𝑥))) |
| 16 | 8, 15 | sylan2 605 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (0 ≤ ((𝐺‘𝑥) − (𝐹‘𝑥)) ↔ (𝐹‘𝑥) ≤ (𝐺‘𝑥))) |
| 17 | 7, 16 | mpbird 260 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → 0 ≤ ((𝐺‘𝑥) − (𝐹‘𝑥))) |
| 18 | 10 | ffnd 6702 | . . . . . . 7 ⊢ (𝜑 → 𝐺 Fn ℝ) |
| 19 | 13 | ffnd 6702 | . . . . . . 7 ⊢ (𝜑 → 𝐹 Fn ℝ) |
| 20 | reex 11272 | . . . . . . . 8 ⊢ ℝ ∈ V | |
| 21 | 20 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → ℝ ∈ V) |
| 22 | inidm 4172 | . . . . . . 7 ⊢ (ℝ ∩ ℝ) = ℝ | |
| 23 | eqidd 2762 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 24 | eqidd 2762 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 25 | 18, 19, 21, 21, 22, 23, 24 | ofval 7693 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ((𝐺 ∘f − 𝐹)‘𝑥) = ((𝐺‘𝑥) − (𝐹‘𝑥))) |
| 26 | 8, 25 | sylan2 605 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → ((𝐺 ∘f − 𝐹)‘𝑥) = ((𝐺‘𝑥) − (𝐹‘𝑥))) |
| 27 | 17, 26 | breqtrrd 5133 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → 0 ≤ ((𝐺 ∘f − 𝐹)‘𝑥)) |
| 28 | 4, 5, 6, 27 | itg1ge0a 26012 | . . 3 ⊢ (𝜑 → 0 ≤ (∫1‘(𝐺 ∘f − 𝐹))) |
| 29 | itg1sub 26010 | . . . 4 ⊢ ((𝐺 ∈ dom ∫1 ∧ 𝐹 ∈ dom ∫1) → (∫1‘(𝐺 ∘f − 𝐹)) = ((∫1‘𝐺) − (∫1‘𝐹))) | |
| 30 | 1, 2, 29 | syl2anc 596 | . . 3 ⊢ (𝜑 → (∫1‘(𝐺 ∘f − 𝐹)) = ((∫1‘𝐺) − (∫1‘𝐹))) |
| 31 | 28, 30 | breqtrd 5131 | . 2 ⊢ (𝜑 → 0 ≤ ((∫1‘𝐺) − (∫1‘𝐹))) |
| 32 | itg1cl 25986 | . . . 4 ⊢ (𝐺 ∈ dom ∫1 → (∫1‘𝐺) ∈ ℝ) | |
| 33 | 1, 32 | syl 18 | . . 3 ⊢ (𝜑 → (∫1‘𝐺) ∈ ℝ) |
| 34 | itg1cl 25986 | . . . 4 ⊢ (𝐹 ∈ dom ∫1 → (∫1‘𝐹) ∈ ℝ) | |
| 35 | 2, 34 | syl 18 | . . 3 ⊢ (𝜑 → (∫1‘𝐹) ∈ ℝ) |
| 36 | 33, 35 | subge0d 11887 | . 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 2145 Vcvv 3451 ∖ cdif 3896 ⊆ wss 3899 class class class wbr 5103 dom cdm 5651 ⟶wf 6527 ‘cfv 6531 (class class class)co 7412 ∘f cof 7680 ℝcr 11180 0cc0 11181 ≤ cle 11325 − cmin 11522 vol*covol 25763 ∫1citg1 25916 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 ax-addf 11260 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-disj 5071 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7682 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-er 8701 df-map 8833 df-pm 8834 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-inf 9419 df-oi 9488 df-dju 9963 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-q 13057 df-rp 13102 df-xadd 13223 df-ioo 13461 df-ico 13463 df-icc 13464 df-fz 13621 df-fzo 13769 df-fl 13912 df-seq 14125 df-exp 14185 df-hash 14455 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-clim 15635 df-sum 15834 df-xmet 21651 df-met 21652 df-ovol 25765 df-vol 25766 df-mbf 25920 df-itg1 25921 |
| This theorem is used by: itg1le 26014 itg2uba 26044 itg2splitlem 26049 |
| Copyright terms: Public domain | W3C validator |