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 | iccssre 12905 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ) | |
2 | 1 | 3adant3 1133 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐴[,]𝐵) ⊆ ℝ) |
3 | ovolcl 24232 | . . 3 ⊢ ((𝐴[,]𝐵) ⊆ ℝ → (vol*‘(𝐴[,]𝐵)) ∈ ℝ*) | |
4 | 2, 3 | syl 17 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (vol*‘(𝐴[,]𝐵)) ∈ ℝ*) |
5 | simp2 1138 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐵 ∈ ℝ) | |
6 | simp1 1137 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ∈ ℝ) | |
7 | 5, 6 | resubcld 11148 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐵 − 𝐴) ∈ ℝ) |
8 | 7 | rexrd 10771 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐵 − 𝐴) ∈ ℝ*) |
9 | simp3 1139 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → 𝐴 ≤ 𝐵) | |
10 | eqeq1 2742 | . . . . 5 ⊢ (𝑚 = 𝑛 → (𝑚 = 1 ↔ 𝑛 = 1)) | |
11 | 10 | ifbid 4437 | . . . 4 ⊢ (𝑚 = 𝑛 → if(𝑚 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉) = if(𝑛 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉)) |
12 | 11 | cbvmptv 5133 | . . 3 ⊢ (𝑚 ∈ ℕ ↦ if(𝑚 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉)) = (𝑛 ∈ ℕ ↦ if(𝑛 = 1, 〈𝐴, 𝐵〉, 〈0, 0〉)) |
13 | 6, 5, 9, 12 | ovolicc1 24270 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (vol*‘(𝐴[,]𝐵)) ≤ (𝐵 − 𝐴)) |
14 | eqeq1 2742 | . . . . . 6 ⊢ (𝑧 = 𝑦 → (𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ) ↔ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) | |
15 | 14 | anbi2d 632 | . . . . 5 ⊢ (𝑧 = 𝑦 → (((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
16 | 15 | rexbidv 3207 | . . . 4 ⊢ (𝑧 = 𝑦 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
17 | 16 | cbvrabv 3393 | . . 3 ⊢ {𝑧 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑧 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)((𝐴[,]𝐵) ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} |
18 | 6, 5, 9, 17 | ovolicc2 24276 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (𝐵 − 𝐴) ≤ (vol*‘(𝐴[,]𝐵))) |
19 | 4, 8, 13, 18 | xrletrid 12633 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 ≤ 𝐵) → (vol*‘(𝐴[,]𝐵)) = (𝐵 − 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1088 = wceq 1542 ∈ wcel 2114 ∃wrex 3054 {crab 3057 ∩ cin 3842 ⊆ wss 3843 ifcif 4414 〈cop 4522 ∪ cuni 4796 class class class wbr 5030 ↦ cmpt 5110 × cxp 5523 ran crn 5526 ∘ ccom 5529 ‘cfv 6339 (class class class)co 7172 ↑m cmap 8439 supcsup 8979 ℝcr 10616 0cc0 10617 1c1 10618 + caddc 10620 ℝ*cxr 10754 < clt 10755 ≤ cle 10756 − cmin 10950 ℕcn 11718 (,)cioo 12823 [,]cicc 12826 seqcseq 13462 abscabs 14685 vol*covol 24216 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5232 ax-pr 5296 ax-un 7481 ax-inf2 9179 ax-cnex 10673 ax-resscn 10674 ax-1cn 10675 ax-icn 10676 ax-addcl 10677 ax-addrcl 10678 ax-mulcl 10679 ax-mulrcl 10680 ax-mulcom 10681 ax-addass 10682 ax-mulass 10683 ax-distr 10684 ax-i2m1 10685 ax-1ne0 10686 ax-1rid 10687 ax-rnegex 10688 ax-rrecex 10689 ax-cnre 10690 ax-pre-lttri 10691 ax-pre-lttrn 10692 ax-pre-ltadd 10693 ax-pre-mulgt0 10694 ax-pre-sup 10695 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-nel 3039 df-ral 3058 df-rex 3059 df-reu 3060 df-rmo 3061 df-rab 3062 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-pss 3862 df-nul 4212 df-if 4415 df-pw 4490 df-sn 4517 df-pr 4519 df-tp 4521 df-op 4523 df-uni 4797 df-int 4837 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5429 df-eprel 5434 df-po 5442 df-so 5443 df-fr 5483 df-se 5484 df-we 5485 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-isom 6348 df-riota 7129 df-ov 7175 df-oprab 7176 df-mpo 7177 df-om 7602 df-1st 7716 df-2nd 7717 df-wrecs 7978 df-recs 8039 df-rdg 8077 df-1o 8133 df-er 8322 df-map 8441 df-en 8558 df-dom 8559 df-sdom 8560 df-fin 8561 df-fi 8950 df-sup 8981 df-inf 8982 df-oi 9049 df-card 9443 df-pnf 10757 df-mnf 10758 df-xr 10759 df-ltxr 10760 df-le 10761 df-sub 10952 df-neg 10953 df-div 11378 df-nn 11719 df-2 11781 df-3 11782 df-n0 11979 df-z 12065 df-uz 12327 df-q 12433 df-rp 12475 df-xneg 12592 df-xadd 12593 df-xmul 12594 df-ioo 12827 df-ico 12829 df-icc 12830 df-fz 12984 df-fzo 13127 df-seq 13463 df-exp 13524 df-hash 13785 df-cj 14550 df-re 14551 df-im 14552 df-sqrt 14686 df-abs 14687 df-clim 14937 df-sum 15138 df-rest 16801 df-topgen 16822 df-psmet 20211 df-xmet 20212 df-met 20213 df-bl 20214 df-mopn 20215 df-top 21647 df-topon 21664 df-bases 21699 df-cmp 22140 df-ovol 24218 |
This theorem is referenced by: ovolicopnf 24278 iccvolcl 24321 ovolioo 24322 dyadovol 24347 volcn 24360 vitalilem4 24365 vitalilem5 24366 ftc1a 24791 areacirc 35515 arearect 40640 areaquad 40641 volicc 43103 |
Copyright terms: Public domain | W3C validator |