Metamath Proof Explorer


Theorem ovolval2

Description: The value of the Lebesgue outer measure for subsets of the reals, expressed using sum^ . See ovolval for an alternative expression. (Contributed by Glauco Siliprandi, 3-Mar-2021)

Ref Expression
Hypotheses ovolval2.a ⊢ φ → A ⊆ ℝ
ovolval2.m ⊢ M = y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sum^ ⁡ abs ∘ − ∘ f
Assertion ovolval2 ⊢ φ → vol * ⁡ A = inf M ℝ * <

Proof

Step Hyp Ref Expression
1 ovolval2.a ⊢ φ → A ⊆ ℝ
2 ovolval2.m ⊢ M = y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sum^ ⁡ abs ∘ − ∘ f
3 eqid ⊢ y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < = y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * <
4 3 ovolval ⊢ A ⊆ ℝ → vol * ⁡ A = inf y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ℝ * <
5 1 4 syl ⊢ φ → vol * ⁡ A = inf y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ℝ * <
6 3 a1i ⊢ φ → y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < = y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * <
7 reex ⊢ ℝ ∈ V
8 7 7 xpex ⊢ ℝ 2 ∈ V
9 inss2 ⊢ ≤ ∩ ℝ 2 ⊆ ℝ 2
10 mapss ⊢ ℝ 2 ∈ V ∧ ≤ ∩ ℝ 2 ⊆ ℝ 2 → ≤ ∩ ℝ 2 ℕ ⊆ ℝ 2 ℕ
11 8 9 10 mp2an ⊢ ≤ ∩ ℝ 2 ℕ ⊆ ℝ 2 ℕ
12 11 sseli ⊢ f ∈ ≤ ∩ ℝ 2 ℕ → f ∈ ℝ 2 ℕ
13 1zzd ⊢ f ∈ ℝ 2 ℕ → 1 ∈ ℤ
14 12 13 syl ⊢ f ∈ ≤ ∩ ℝ 2 ℕ → 1 ∈ ℤ
15 14 adantl ⊢ φ ∧ f ∈ ≤ ∩ ℝ 2 ℕ → 1 ∈ ℤ
16 nnuz ⊢ ℕ = ℤ ≥ 1
17 absfico ⊢ abs : ℂ ⟶ 0 +∞
18 subf ⊢ − : ℂ × ℂ ⟶ ℂ
19 fco ⊢ abs : ℂ ⟶ 0 +∞ ∧ − : ℂ × ℂ ⟶ ℂ → abs ∘ − : ℂ × ℂ ⟶ 0 +∞
20 17 18 19 mp2an ⊢ abs ∘ − : ℂ × ℂ ⟶ 0 +∞
21 20 a1i ⊢ f ∈ ≤ ∩ ℝ 2 ℕ → abs ∘ − : ℂ × ℂ ⟶ 0 +∞
22 rr2sscn2 ⊢ ℝ 2 ⊆ ℂ × ℂ
23 22 a1i ⊢ f ∈ ≤ ∩ ℝ 2 ℕ → ℝ 2 ⊆ ℂ × ℂ
24 elmapi ⊢ f ∈ ℝ 2 ℕ → f : ℕ ⟶ ℝ 2
25 12 24 syl ⊢ f ∈ ≤ ∩ ℝ 2 ℕ → f : ℕ ⟶ ℝ 2
26 21 23 25 fcoss ⊢ f ∈ ≤ ∩ ℝ 2 ℕ → abs ∘ − ∘ f : ℕ ⟶ 0 +∞
27 26 adantl ⊢ φ ∧ f ∈ ≤ ∩ ℝ 2 ℕ → abs ∘ − ∘ f : ℕ ⟶ 0 +∞
28 eqid ⊢ seq 1 + abs ∘ − ∘ f = seq 1 + abs ∘ − ∘ f
29 15 16 27 28 sge0seq ⊢ φ ∧ f ∈ ≤ ∩ ℝ 2 ℕ → sum^ ⁡ abs ∘ − ∘ f = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * <
30 29 eqcomd ⊢ φ ∧ f ∈ ≤ ∩ ℝ 2 ℕ → sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < = sum^ ⁡ abs ∘ − ∘ f
31 30 eqeq2d ⊢ φ ∧ f ∈ ≤ ∩ ℝ 2 ℕ → y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ↔ y = sum^ ⁡ abs ∘ − ∘ f
32 31 anbi2d ⊢ φ ∧ f ∈ ≤ ∩ ℝ 2 ℕ → A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ↔ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sum^ ⁡ abs ∘ − ∘ f
33 32 rexbidva ⊢ φ → ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ↔ ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sum^ ⁡ abs ∘ − ∘ f
34 33 rabbidv ⊢ φ → y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < = y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sum^ ⁡ abs ∘ − ∘ f
35 2 eqcomi ⊢ y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sum^ ⁡ abs ∘ − ∘ f = M
36 35 a1i ⊢ φ → y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sum^ ⁡ abs ∘ − ∘ f = M
37 6 34 36 3eqtrd ⊢ φ → y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < = M
38 37 infeq1d ⊢ φ → inf y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ℝ * < = inf M ℝ * <
39 5 38 eqtrd ⊢ φ → vol * ⁡ A = inf M ℝ * <