![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ovolicc | Structured version Visualization version GIF version |
Description: The measure of a closed interval. (Contributed by Mario Carneiro, 14-Jun-2014.) |
Ref | Expression |
---|---|
ovolicc | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (vol*‘(𝐴[,]𝐵)) = (𝐵 − 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1 1061 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ) | |
2 | simp2 1062 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ) | |
3 | simp3 1063 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵) | |
4 | eqeq1 2626 | . . . . 5 ⊢ (𝑚 = 𝑛 → (𝑚 = 1 ↔ 𝑛 = 1)) | |
5 | 4 | ifbid 4108 | . . . 4 ⊢ (𝑚 = 𝑛 → if(𝑚 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉) = if(𝑛 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉)) |
6 | 5 | cbvmptv 4750 | . . 3 ⊢ (𝑚 ∈ ℕ ↦ if(𝑚 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉)) = (𝑛 ∈ ℕ ↦ if(𝑛 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉)) |
7 | 1, 2, 3, 6 | ovolicc1 23284 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (vol*‘(𝐴[,]𝐵)) ≤ (𝐵 − 𝐴)) |
8 | eqeq1 2626 | . . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ↔ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) | |
9 | 8 | anbi2d 740 | . . . . 5 ⊢ (𝑧 = 𝑦 → (((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
10 | 9 | rexbidv 3052 | . . . 4 ⊢ (𝑧 = 𝑦 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑𝑚 ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑𝑚 ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
11 | 10 | cbvrabv 3199 | . . 3 ⊢ {𝑧 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑𝑚 ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑𝑚 ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} |
12 | 1, 2, 3, 11 | ovolicc2 23290 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐵 − 𝐴) ≤ (vol*‘(𝐴[,]𝐵))) |
13 | iccssre 12255 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
14 | 1, 2, 13 | syl2anc 693 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) ⊆ ℝ) |
15 | ovolcl 23246 | . . . 4 ⊢ ((𝐴[,]𝐵) ⊆ ℝ → (vol*‘(𝐴[,]𝐵)) ∈ ℝ*) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (vol*‘(𝐴[,]𝐵)) ∈ ℝ*) |
17 | 2, 1 | resubcld 10458 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐵 − 𝐴) ∈ ℝ) |
18 | 17 | rexrd 10089 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐵 − 𝐴) ∈ ℝ*) |
19 | xrletri3 11985 | . . 3 ⊢ (((vol*‘(𝐴[,]𝐵)) ∈ ℝ* ∧ (𝐵 − 𝐴) ∈ ℝ*) → ((vol*‘(𝐴[,]𝐵)) = (𝐵 − 𝐴) ↔ ((vol*‘(𝐴[,]𝐵)) ≤ (𝐵 − 𝐴) ∧ (𝐵 − 𝐴) ≤ (vol*‘(𝐴[,]𝐵))))) | |
20 | 16, 18, 19 | syl2anc 693 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → ((vol*‘(𝐴[,]𝐵)) = (𝐵 − 𝐴) ↔ ((vol*‘(𝐴[,]𝐵)) ≤ (𝐵 − 𝐴) ∧ (𝐵 − 𝐴) ≤ (vol*‘(𝐴[,]𝐵))))) |
21 | 7, 12, 20 | mpbir2and 957 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (vol*‘(𝐴[,]𝐵)) = (𝐵 − 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 {crab 2916 ∩ cin 3573 ⊆ wss 3574 ifcif 4086 〈cop 4183 ∪ cuni 4436 class class class wbr 4653 ↦ cmpt 4729 × cxp 5112 ran crn 5115 ∘ ccom 5118 ‘cfv 5888 (class class class)co 6650 ↑𝑚 cmap 7857 supcsup 8346 ℝcr 9935 0cc0 9936 1c1 9937 + caddc 9939 ℝ*cxr 10073 < clt 10074 ≤ cle 10075 − cmin 10266 ℕcn 11020 (,)cioo 12175 [,]cicc 12178 seqcseq 12801 abscabs 13974 vol*covol 23231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-fi 8317 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-z 11378 df-uz 11688 df-q 11789 df-rp 11833 df-xneg 11946 df-xadd 11947 df-xmul 11948 df-ioo 12179 df-ico 12181 df-icc 12182 df-fz 12327 df-fzo 12466 df-seq 12802 df-exp 12861 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-sum 14417 df-rest 16083 df-topgen 16104 df-psmet 19738 df-xmet 19739 df-met 19740 df-bl 19741 df-mopn 19742 df-top 20699 df-topon 20716 df-bases 20750 df-cmp 21190 df-ovol 23233 |
This theorem is referenced by: ovolicopnf 23292 iccvolcl 23335 ovolioo 23336 dyadovol 23361 volcn 23374 vitalilem4 23380 vitalilem5 23381 ftc1a 23800 areacirc 33505 arearect 37801 areaquad 37802 volicc 40215 |
Copyright terms: Public domain | W3C validator |