| 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 11328 | . . 3 ⊢ ℝ ∈ V | |
| 2 | 1 | elpw2 5301 | . 2 ⊢ (𝐴 ∈ 𝒫 ℝ ↔ 𝐴 ⊆ ℝ) |
| 3 | cleq1lem 15176 | . . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) | |
| 4 | 3 | rexbidv 3190 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
| 5 | 4 | rabbidv 3423 | . . . . 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 2816 | . . . 4 ⊢ (𝑥 = 𝐴 → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = 𝑀) |
| 8 | 7 | infeq1d 9505 | . . 3 ⊢ (𝑥 = 𝐴 → inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ) = inf(𝑀, ℝ*, < )) |
| 9 | df-ovol 25829 | . . 3 ⊢ vol* = (𝑥 ∈ 𝒫 ℝ ↦ inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < )) | |
| 10 | xrltso 13308 | . . . 4 ⊢ < Or ℝ* | |
| 11 | 10 | infex 9522 | . . 3 ⊢ inf(𝑀, ℝ*, < ) ∈ V |
| 12 | 8, 9, 11 | fvmpt 7022 | . 2 ⊢ (𝐴 ∈ 𝒫 ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < )) |
| 13 | 2, 12 | sylbir 238 | 1 ⊢ (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∃wrex 3090 {crab 3416 ⊆ wss 3900 ∩ cin 4092 𝒫 cpw 4560 ∪ cuni 4870 × cxp 5654 ran crn 5657 ∘ ccom 5660 ‘cfv 6564 (class class class)co 7449 ↑m cmap 8883 supcsup 9467 infcinf 9468 ℝcr 11236 1c1 11238 + caddc 11240 ℝ*cxr 11379 < clt 11380 ≤ cle 11381 − cmin 11578 ℕcn 12373 (,)cioo 13514 seqcseq 14182 abscabs 15442 vol*covol 25827 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7781 ax-cnex 11293 ax-resscn 11294 ax-pre-lttri 11311 ax-pre-lttrn 11312 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-po 5564 df-so 5565 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-f1 6569 df-fo 6570 df-f1o 6571 df-fv 6572 df-er 8753 df-en 9010 df-dom 9011 df-sdom 9012 df-sup 9469 df-inf 9470 df-pnf 11382 df-mnf 11383 df-xr 11384 df-ltxr 11385 df-ovol 25829 |
| This theorem is used by: ovolcl 25843 ovollb 25844 ovolgelb 25845 ovolge0 25846 ovolsslem 25849 ovolshft 25876 ovolicc2 25887 ismblfin 38840 ovolval2 47921 |
| Copyright terms: Public domain | W3C validator |