ovolval - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ovolval		Structured version Visualization version GIF version

Theorem ovolval 24068

Description: The value of the outer measure. (Contributed by Mario Carneiro, 16-Mar-2014.) (Revised by AV, 17-Sep-2020.)

**Hypothesis**
Ref	Expression
ovolval.1	⊢ 𝑀 = {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))}

**Assertion**
Ref	Expression
ovolval	⊢ (𝐴 ⊆ ℝ → (vol‘𝐴) = inf(𝑀, ℝ^, < ))

Distinct variable group: 𝐴,𝑓,𝑦 Allowed substitution hints: 𝑀(𝑦,𝑓)

Proof of Theorem ovolval Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		reex 10622	. . 3 ⊢ ℝ ∈ V
2	1	elpw2 5240	. 2 ⊢ (𝐴 ∈ 𝒫 ℝ ↔ 𝐴 ⊆ ℝ)
3		cleq1lem 14336	. . . . . . 7 ⊢ (𝑥 = 𝐴 → ((𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))))
4	3	rexbidv 3297	. . . . . 6 ⊢ (𝑥 = 𝐴 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))))
5	4	rabbidv 3480	. . . . 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	syl6eqr 2874	. . . 4 ⊢ (𝑥 = 𝐴 → {𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^*, < ))} = 𝑀)
8	7	infeq1d 8935	. . 3 ⊢ (𝑥 = 𝐴 → inf({𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))}, ℝ^, < ) = inf(𝑀, ℝ^*, < ))
9		df-ovol 24059	. . 3 ⊢ vol* = (𝑥 ∈ 𝒫 ℝ ↦ inf({𝑦 ∈ ℝ^* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑_m ℕ)(𝑥 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ^, < ))}, ℝ^, < ))
10		xrltso 12528	. . . 4 ⊢ < Or ℝ^*
11	10	infex 8951	. . 3 ⊢ inf(𝑀, ℝ^*, < ) ∈ V
12	8, 9, 11	fvmpt 6762	. 2 ⊢ (𝐴 ∈ 𝒫 ℝ → (vol‘𝐴) = inf(𝑀, ℝ^, < ))
13	2, 12	sylbir 237	1 ⊢ (𝐴 ⊆ ℝ → (vol‘𝐴) = inf(𝑀, ℝ^, < ))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∃wrex 3139 {crab 3142 ∩ cin 3934 ⊆ wss 3935 𝒫 cpw 4538 ∪ cuni 4831 × cxp 5547 ran crn 5550 ∘ ccom 5553 ‘cfv 6349 (class class class)co 7150 ↑_m cmap 8400 supcsup 8898 infcinf 8899 ℝcr 10530 1c1 10532 + caddc 10534 ℝ^*cxr 10668 < clt 10669 ≤ cle 10670 − cmin 10864 ℕcn 11632 (,)cioo 12732 seqcseq 13363 abscabs 14587 vol*covol 24057

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-pre-lttri 10605 ax-pre-lttrn 10606

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-po 5468 df-so 5469 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-sup 8900 df-inf 8901 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-ovol 24059

This theorem is referenced by: ovolcl 24073 ovollb 24074 ovolgelb 24075 ovolge0 24076 ovolsslem 24079 ovolshft 24106 ovolicc2 24117 ismblfin 34927 ovolval2 42920

W3C validator