| 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 25770. 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 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐺:ℝ⟶(0[,]+∞)) |
| 3 | simprl 778 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓 ∈ dom ∫1) | |
| 4 | itg2lea.3 | . . . . . 6 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 5 | 4 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐴 ⊆ ℝ) |
| 6 | itg2lea.4 | . . . . . 6 ⊢ (𝜑 → (vol*‘𝐴) = 0) | |
| 7 | 6 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → (vol*‘𝐴) = 0) |
| 8 | i1ff 25707 | . . . . . . . . 9 ⊢ (𝑓 ∈ dom ∫1 → 𝑓:ℝ⟶ℝ) | |
| 9 | 8 | ad2antrl 736 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓:ℝ⟶ℝ) |
| 10 | eldifi 4075 | . . . . . . . 8 ⊢ (𝑥 ∈ (ℝ ∖ 𝐴) → 𝑥 ∈ ℝ) | |
| 11 | ffvelcdm 7047 | . . . . . . . 8 ⊢ ((𝑓:ℝ⟶ℝ ∧ 𝑥 ∈ ℝ) → (𝑓‘𝑥) ∈ ℝ) | |
| 12 | 9, 10, 11 | syl2an 604 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ∈ ℝ) |
| 13 | 12 | rexrd 11218 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ∈ ℝ*) |
| 14 | iccssxr 13420 | . . . . . . 7 ⊢ (0[,]+∞) ⊆ ℝ* | |
| 15 | itg2lea.1 | . . . . . . . . 9 ⊢ (𝜑 → 𝐹:ℝ⟶(0[,]+∞)) | |
| 16 | 15 | adantr 483 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐹:ℝ⟶(0[,]+∞)) |
| 17 | ffvelcdm 7047 | . . . . . . . 8 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) ∈ (0[,]+∞)) | |
| 18 | 16, 10, 17 | syl2an 604 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ∈ (0[,]+∞)) |
| 19 | 14, 18 | sselid 3925 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ∈ ℝ*) |
| 20 | ffvelcdm 7047 | . . . . . . . 8 ⊢ ((𝐺:ℝ⟶(0[,]+∞) ∧ 𝑥 ∈ ℝ) → (𝐺‘𝑥) ∈ (0[,]+∞)) | |
| 21 | 2, 10, 20 | syl2an 604 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐺‘𝑥) ∈ (0[,]+∞)) |
| 22 | 14, 21 | sselid 3925 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐺‘𝑥) ∈ ℝ*) |
| 23 | simprr 780 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓 ∘r ≤ 𝐹) | |
| 24 | 9 | ffnd 6677 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝑓 Fn ℝ) |
| 25 | 16 | ffnd 6677 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → 𝐹 Fn ℝ) |
| 26 | reex 11150 | . . . . . . . . . . 11 ⊢ ℝ ∈ V | |
| 27 | 26 | a1i 11 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → ℝ ∈ V) |
| 28 | inidm 4169 | . . . . . . . . . 10 ⊢ (ℝ ∩ ℝ) = ℝ | |
| 29 | eqidd 2753 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ ℝ) → (𝑓‘𝑥) = (𝑓‘𝑥)) | |
| 30 | eqidd 2753 | . . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ ℝ) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 31 | 24, 25, 27, 27, 28, 29, 30 | ofrfval 7655 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → (𝑓 ∘r ≤ 𝐹 ↔ ∀𝑥 ∈ ℝ (𝑓‘𝑥) ≤ (𝐹‘𝑥))) |
| 32 | 23, 31 | mpbid 234 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → ∀𝑥 ∈ ℝ (𝑓‘𝑥) ≤ (𝐹‘𝑥)) |
| 33 | 32 | r19.21bi 3244 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ ℝ) → (𝑓‘𝑥) ≤ (𝐹‘𝑥)) |
| 34 | 10, 33 | sylan2 601 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ≤ (𝐹‘𝑥)) |
| 35 | itg2lea.5 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ≤ (𝐺‘𝑥)) | |
| 36 | 35 | adantlr 723 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝐹‘𝑥) ≤ (𝐺‘𝑥)) |
| 37 | 13, 19, 22, 34, 36 | xrletrd 13150 | . . . . 5 ⊢ (((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) ∧ 𝑥 ∈ (ℝ ∖ 𝐴)) → (𝑓‘𝑥) ≤ (𝐺‘𝑥)) |
| 38 | 2, 3, 5, 7, 37 | itg2uba 25774 | . . . 4 ⊢ ((𝜑 ∧ (𝑓 ∈ dom ∫1 ∧ 𝑓 ∘r ≤ 𝐹)) → (∫1‘𝑓) ≤ (∫2‘𝐺)) |
| 39 | 38 | expr 459 | . . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ dom ∫1) → (𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺))) |
| 40 | 39 | ralrimiva 3144 | . 2 ⊢ (𝜑 → ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺))) |
| 41 | itg2cl 25763 | . . . 4 ⊢ (𝐺:ℝ⟶(0[,]+∞) → (∫2‘𝐺) ∈ ℝ*) | |
| 42 | 1, 41 | syl 17 | . . 3 ⊢ (𝜑 → (∫2‘𝐺) ∈ ℝ*) |
| 43 | itg2leub 25765 | . . 3 ⊢ ((𝐹:ℝ⟶(0[,]+∞) ∧ (∫2‘𝐺) ∈ ℝ*) → ((∫2‘𝐹) ≤ (∫2‘𝐺) ↔ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺)))) | |
| 44 | 15, 42, 43 | syl2anc 592 | . 2 ⊢ (𝜑 → ((∫2‘𝐹) ≤ (∫2‘𝐺) ↔ ∀𝑓 ∈ dom ∫1(𝑓 ∘r ≤ 𝐹 → (∫1‘𝑓) ≤ (∫2‘𝐺)))) |
| 45 | 40, 44 | mpbird 259 | 1 ⊢ (𝜑 → (∫2‘𝐹) ≤ (∫2‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1550 ∈ wcel 2132 ∀wral 3066 Vcvv 3444 ∖ cdif 3892 ⊆ wss 3895 class class class wbr 5090 dom cdm 5636 ⟶wf 6502 ‘cfv 6506 (class class class)co 7381 ∘r cofr 7644 ℝcr 11058 0cc0 11059 +∞cpnf 11199 ℝ*cxr 11201 ≤ cle 11203 [,]cicc 13338 vol*covol 25493 ∫1citg1 25646 ∫2citg2 25647 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-rep 5217 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-inf2 9582 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 ax-pre-sup 11137 ax-addf 11138 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-int 4896 df-iun 4941 df-disj 5058 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-se 5590 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-isom 6515 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-of 7645 df-ofr 7646 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-1o 8421 df-2o 8422 df-er 8662 df-map 8794 df-pm 8795 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-fi 9343 df-sup 9374 df-inf 9375 df-oi 9444 df-dju 9845 df-card 9883 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-div 11831 df-nn 12197 df-2 12266 df-3 12267 df-n0 12468 df-z 12555 df-uz 12826 df-q 12936 df-rp 12980 df-xneg 13100 df-xadd 13101 df-xmul 13102 df-ioo 13339 df-ico 13341 df-icc 13342 df-fz 13499 df-fzo 13646 df-fl 13788 df-seq 14001 df-exp 14061 df-hash 14330 df-cj 15098 df-re 15099 df-im 15100 df-sqrt 15234 df-abs 15235 df-clim 15487 df-sum 15686 df-rest 17423 df-topgen 17444 df-psmet 21385 df-xmet 21386 df-met 21387 df-bl 21388 df-mopn 21389 df-top 22923 df-topon 22940 df-bases 22975 df-cmp 23416 df-ovol 25495 df-vol 25496 df-mbf 25650 df-itg1 25651 df-itg2 25652 |
| This theorem is referenced by: itg2eqa 25776 |
| Copyright terms: Public domain | W3C validator |