Metamath Proof Explorer


Theorem uniiccmbl

Description: An almost-disjoint union of closed intervals is measurable. (This proof does not use countable choice, unlike iunmbl .) (Contributed by Mario Carneiro, 25-Mar-2015)

Ref Expression
Hypotheses uniioombl.1 ⊢ φ → F : ℕ ⟶ ≤ ∩ ℝ 2
uniioombl.2 ⊢ φ → Disj x ∈ ℕ . ⁡ F ⁡ x
uniioombl.3 ⊢ S = seq 1 + abs ∘ − ∘ F
Assertion uniiccmbl ⊢ φ → ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol

Proof

Step Hyp Ref Expression
1 uniioombl.1 ⊢ φ → F : ℕ ⟶ ≤ ∩ ℝ 2
2 uniioombl.2 ⊢ φ → Disj x ∈ ℕ . ⁡ F ⁡ x
3 uniioombl.3 ⊢ S = seq 1 + abs ∘ − ∘ F
4 1 uniiccdif ⊢ φ → ⋃ ran ⁡ . ∘ F ⊆ ⋃ ran ⁡ . ∘ F ∧ vol * ⁡ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F = 0
5 4 simpld ⊢ φ → ⋃ ran ⁡ . ∘ F ⊆ ⋃ ran ⁡ . ∘ F
6 undif ⊢ ⋃ ran ⁡ . ∘ F ⊆ ⋃ ran ⁡ . ∘ F ↔ ⋃ ran ⁡ . ∘ F ∪ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F = ⋃ ran ⁡ . ∘ F
7 5 6 sylib ⊢ φ → ⋃ ran ⁡ . ∘ F ∪ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F = ⋃ ran ⁡ . ∘ F
8 1 2 3 uniioombl ⊢ φ → ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol
9 ovolficcss ⊢ F : ℕ ⟶ ≤ ∩ ℝ 2 → ⋃ ran ⁡ . ∘ F ⊆ ℝ
10 1 9 syl ⊢ φ → ⋃ ran ⁡ . ∘ F ⊆ ℝ
11 10 ssdifssd ⊢ φ → ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F ⊆ ℝ
12 4 simprd ⊢ φ → vol * ⁡ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F = 0
13 nulmbl ⊢ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F ⊆ ℝ ∧ vol * ⁡ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F = 0 → ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol
14 11 12 13 syl2anc ⊢ φ → ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol
15 unmbl ⊢ ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol ∧ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol → ⋃ ran ⁡ . ∘ F ∪ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol
16 8 14 15 syl2anc ⊢ φ → ⋃ ran ⁡ . ∘ F ∪ ⋃ ran ⁡ . ∘ F ∖ ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol
17 7 16 eqeltrrd ⊢ φ → ⋃ ran ⁡ . ∘ F ∈ dom ⁡ vol