Metamath Proof Explorer


Theorem icombl

Description: A closed-below, open-above real interval is measurable. (Contributed by Mario Carneiro, 16-Jun-2014)

Ref Expression
Assertion icombl ⊢ A ∈ ℝ ∧ B ∈ ℝ * → A B ∈ dom ⁡ vol

Proof

Step Hyp Ref Expression
1 uncom ⊢ B +∞ ∪ A B = A B ∪ B +∞
2 rexr ⊢ A ∈ ℝ → A ∈ ℝ *
3 2 ad2antrr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A ∈ ℝ *
4 simplr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B ∈ ℝ *
5 pnfxr ⊢ +∞ ∈ ℝ *
6 5 a1i ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → +∞ ∈ ℝ *
7 xrltle ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A < B → A ≤ B
8 2 7 sylan ⊢ A ∈ ℝ ∧ B ∈ ℝ * → A < B → A ≤ B
9 8 imp ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A ≤ B
10 pnfge ⊢ B ∈ ℝ * → B ≤ +∞
11 4 10 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B ≤ +∞
12 icoun ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ +∞ ∈ ℝ * ∧ A ≤ B ∧ B ≤ +∞ → A B ∪ B +∞ = A +∞
13 3 4 6 9 11 12 syl32anc ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A B ∪ B +∞ = A +∞
14 1 13 eqtrid ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B +∞ ∪ A B = A +∞
15 ssun1 ⊢ B +∞ ⊆ B +∞ ∪ A B
16 15 14 sseqtrid ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B +∞ ⊆ A +∞
17 incom ⊢ B +∞ ∩ A B = A B ∩ B +∞
18 icodisj ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ +∞ ∈ ℝ * → A B ∩ B +∞ = ∅
19 5 18 mp3an3 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A B ∩ B +∞ = ∅
20 3 4 19 syl2anc ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A B ∩ B +∞ = ∅
21 17 20 eqtrid ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B +∞ ∩ A B = ∅
22 uneqdifeq ⊢ B +∞ ⊆ A +∞ ∧ B +∞ ∩ A B = ∅ → B +∞ ∪ A B = A +∞ ↔ A +∞ ∖ B +∞ = A B
23 16 21 22 syl2anc ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B +∞ ∪ A B = A +∞ ↔ A +∞ ∖ B +∞ = A B
24 14 23 mpbid ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A +∞ ∖ B +∞ = A B
25 icombl1 ⊢ A ∈ ℝ → A +∞ ∈ dom ⁡ vol
26 25 ad2antrr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A +∞ ∈ dom ⁡ vol
27 xrleloe ⊢ B ∈ ℝ * ∧ +∞ ∈ ℝ * → B ≤ +∞ ↔ B < +∞ ∨ B = +∞
28 4 6 27 syl2anc ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B ≤ +∞ ↔ B < +∞ ∨ B = +∞
29 11 28 mpbid ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B < +∞ ∨ B = +∞
30 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A < B
31 xrre2 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ +∞ ∈ ℝ * ∧ A < B ∧ B < +∞ → B ∈ ℝ
32 31 expr ⊢ A ∈ ℝ * ∧ B ∈ ℝ * ∧ +∞ ∈ ℝ * ∧ A < B → B < +∞ → B ∈ ℝ
33 3 4 6 30 32 syl31anc ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B < +∞ → B ∈ ℝ
34 33 orim1d ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B < +∞ ∨ B = +∞ → B ∈ ℝ ∨ B = +∞
35 29 34 mpd ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B ∈ ℝ ∨ B = +∞
36 icombl1 ⊢ B ∈ ℝ → B +∞ ∈ dom ⁡ vol
37 oveq1 ⊢ B = +∞ → B +∞ = +∞ +∞
38 pnfge ⊢ +∞ ∈ ℝ * → +∞ ≤ +∞
39 5 38 ax-mp ⊢ +∞ ≤ +∞
40 ico0 ⊢ +∞ ∈ ℝ * ∧ +∞ ∈ ℝ * → +∞ +∞ = ∅ ↔ +∞ ≤ +∞
41 5 5 40 mp2an ⊢ +∞ +∞ = ∅ ↔ +∞ ≤ +∞
42 39 41 mpbir ⊢ +∞ +∞ = ∅
43 37 42 eqtrdi ⊢ B = +∞ → B +∞ = ∅
44 0mbl ⊢ ∅ ∈ dom ⁡ vol
45 43 44 eqeltrdi ⊢ B = +∞ → B +∞ ∈ dom ⁡ vol
46 36 45 jaoi ⊢ B ∈ ℝ ∨ B = +∞ → B +∞ ∈ dom ⁡ vol
47 35 46 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → B +∞ ∈ dom ⁡ vol
48 difmbl ⊢ A +∞ ∈ dom ⁡ vol ∧ B +∞ ∈ dom ⁡ vol → A +∞ ∖ B +∞ ∈ dom ⁡ vol
49 26 47 48 syl2anc ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A +∞ ∖ B +∞ ∈ dom ⁡ vol
50 24 49 eqeltrrd ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ A < B → A B ∈ dom ⁡ vol
51 ico0 ⊢ A ∈ ℝ * ∧ B ∈ ℝ * → A B = ∅ ↔ B ≤ A
52 2 51 sylan ⊢ A ∈ ℝ ∧ B ∈ ℝ * → A B = ∅ ↔ B ≤ A
53 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ * → B ∈ ℝ *
54 2 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ * → A ∈ ℝ *
55 53 54 xrlenltd ⊢ A ∈ ℝ ∧ B ∈ ℝ * → B ≤ A ↔ ¬ A < B
56 52 55 bitrd ⊢ A ∈ ℝ ∧ B ∈ ℝ * → A B = ∅ ↔ ¬ A < B
57 56 biimpar ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ ¬ A < B → A B = ∅
58 57 44 eqeltrdi ⊢ A ∈ ℝ ∧ B ∈ ℝ * ∧ ¬ A < B → A B ∈ dom ⁡ vol
59 50 58 pm2.61dan ⊢ A ∈ ℝ ∧ B ∈ ℝ * → A B ∈ dom ⁡ vol