| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ovolval | Structured version Visualization version GIF version | ||
| Description: The value of the outer measure. (Contributed by Mario Carneiro, 16-Mar-2014.) (Revised by AV, 17-Sep-2020.) |
| Ref | Expression |
|---|---|
| ovolval.1 | ⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} |
| Ref | Expression |
|---|---|
| ovolval | ⊢ (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | reex 11187 | . . 3 ⊢ ℝ ∈ V | |
| 2 | 1 | elpw2 5302 | . 2 ⊢ (𝐴 ∈ 𝒫 ℝ ↔ 𝐴 ⊆ ℝ) |
| 3 | cleq1lem 15015 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) | |
| 4 | 3 | rexbidv 3195 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
| 5 | 4 | rabbidv 3430 | . . . . 5 ⊢ (𝑥 = 𝐴 → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}) |
| 6 | ovolval.1 | . . . . 5 ⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} | |
| 7 | 5, 6 | eqtr4di 2822 | . . . 4 ⊢ (𝑥 = 𝐴 → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = 𝑀) |
| 8 | 7 | infeq1d 9434 | . . 3 ⊢ (𝑥 = 𝐴 → inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ) = inf(𝑀, ℝ*, < )) |
| 9 | df-ovol 25588 | . . 3 ⊢ vol* = (𝑥 ∈ 𝒫 ℝ ↦ inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < )) | |
| 10 | xrltso 13162 | . . . 4 ⊢ < Or ℝ* | |
| 11 | 10 | infex 9451 | . . 3 ⊢ inf(𝑀, ℝ*, < ) ∈ V |
| 12 | 8, 9, 11 | fvmpt 6987 | . 2 ⊢ (𝐴 ∈ 𝒫 ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < )) |
| 13 | 2, 12 | sylbir 238 | 1 ⊢ (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 {crab 3423 ∩ cin 3912 ⊆ wss 3913 𝒫 cpw 4564 ∪ cuni 4873 × cxp 5657 ran crn 5660 ∘ ccom 5663 ‘cfv 6533 (class class class)co 7408 ↑m cmap 8820 supcsup 9396 infcinf 9397 ℝcr 11095 1c1 11097 + caddc 11099 ℝ*cxr 11238 < clt 11239 ≤ cle 11240 − cmin 11437 ℕcn 12229 (,)cioo 13368 seqcseq 14033 abscabs 15281 vol*covol 25586 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-pre-lttri 11170 ax-pre-lttrn 11171 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9398 df-inf 9399 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-ovol 25588 |
| This theorem is referenced by: ovolcl 25602 ovollb 25603 ovolgelb 25604 ovolge0 25605 ovolsslem 25608 ovolshft 25635 ovolicc2 25646 ismblfin 38195 ovolval2 47243 |
| Copyright terms: Public domain | W3C validator |