Metamath Proof Explorer


Theorem ovollb

Description: The outer volume is a lower bound on the sum of all interval coverings of A . (Contributed by Mario Carneiro, 15-Jun-2014)

Ref Expression
Hypothesis ovollb.1 ⊢ S = seq 1 + abs ∘ − ∘ F
Assertion ovollb ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → vol * ⁡ A ≤ sup ran ⁡ S ℝ * <

Proof

Step Hyp Ref Expression
1 ovollb.1 ⊢ S = seq 1 + abs ∘ − ∘ F
2 simpr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → A ⊆ ⋃ ran ⁡ . ∘ F
3 ioof ⊢ . : ℝ * × ℝ * ⟶ 𝒫 ℝ
4 simpl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → F : ℕ ⟶ ≤ ∩ ℝ 2
5 inss2 ⊢ ≤ ∩ ℝ 2 ⊆ ℝ 2
6 rexpssxrxp ⊢ ℝ 2 ⊆ ℝ * × ℝ *
7 5 6 sstri ⊢ ≤ ∩ ℝ 2 ⊆ ℝ * × ℝ *
8 fss ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ ≤ ∩ ℝ 2 ⊆ ℝ * × ℝ * → F : ℕ ⟶ ℝ * × ℝ *
9 4 7 8 sylancl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → F : ℕ ⟶ ℝ * × ℝ *
10 fco ⊢ . : ℝ * × ℝ * ⟶ 𝒫 ℝ ∧ F : ℕ ⟶ ℝ * × ℝ * → . ∘ F : ℕ ⟶ 𝒫 ℝ
11 3 9 10 sylancr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → . ∘ F : ℕ ⟶ 𝒫 ℝ
12 11 frnd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → ran ⁡ . ∘ F ⊆ 𝒫 ℝ
13 sspwuni ⊢ ran ⁡ . ∘ F ⊆ 𝒫 ℝ ↔ ⋃ ran ⁡ . ∘ F ⊆ ℝ
14 12 13 sylib ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → ⋃ ran ⁡ . ∘ F ⊆ ℝ
15 2 14 sstrd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → A ⊆ ℝ
16 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 ℝ * <
17 16 ovolval ⊢ A ⊆ ℝ → vol * ⁡ A = inf y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ℝ * <
18 15 17 syl ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → vol * ⁡ A = inf y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ℝ * <
19 ssrab2 ⊢ y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ⊆ ℝ *
20 16 1 elovolmr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → sup ran ⁡ S ℝ * < ∈ y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * <
21 infxrlb ⊢ y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ⊆ ℝ * ∧ sup ran ⁡ S ℝ * < ∈ y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < → inf y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ℝ * < ≤ sup ran ⁡ S ℝ * <
22 19 20 21 sylancr ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → inf y ∈ ℝ * | ∃ f ∈ ≤ ∩ ℝ 2 ℕ A ⊆ ⋃ ran ⁡ . ∘ f ∧ y = sup ran ⁡ seq 1 + abs ∘ − ∘ f ℝ * < ℝ * < ≤ sup ran ⁡ S ℝ * <
23 18 22 eqbrtrd ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 ∧ A ⊆ ⋃ ran ⁡ . ∘ F → vol * ⁡ A ≤ sup ran ⁡ S ℝ * <