Metamath Proof Explorer


Theorem cnmbf

Description: A continuous function is measurable. (Contributed by Mario Carneiro, 18-Jun-2014) (Revised by Mario Carneiro, 26-Mar-2015)

Ref Expression
Assertion cnmbf ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ → F ∈ MblFn

Proof

Step Hyp Ref Expression
1 cncff ⊢ F : A ⟶cn ℂ → F : A ⟶ ℂ
2 mblss ⊢ A ∈ dom ⁡ vol → A ⊆ ℝ
3 cnex ⊢ ℂ ∈ V
4 reex ⊢ ℝ ∈ V
5 elpm2r ⊢ ℂ ∈ V ∧ ℝ ∈ V ∧ F : A ⟶ ℂ ∧ A ⊆ ℝ → F ∈ ℂ ↑ 𝑝𝑚 ℝ
6 3 4 5 mpanl12 ⊢ F : A ⟶ ℂ ∧ A ⊆ ℝ → F ∈ ℂ ↑ 𝑝𝑚 ℝ
7 1 2 6 syl2anr ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ → F ∈ ℂ ↑ 𝑝𝑚 ℝ
8 simpll ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → A ∈ dom ⁡ vol
9 simplr ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → F : A ⟶cn ℂ
10 recncf ⊢ ℜ : ℂ ⟶cn ℝ
11 10 a1i ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℜ : ℂ ⟶cn ℝ
12 9 11 cncfco ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℜ ∘ F : A ⟶cn ℝ
13 2 ad2antrr ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → A ⊆ ℝ
14 ax-resscn ⊢ ℝ ⊆ ℂ
15 13 14 sstrdi ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → A ⊆ ℂ
16 eqid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld
17 eqid ⊢ TopOpen ⁡ ℂ fld ↾ 𝑡 A = TopOpen ⁡ ℂ fld ↾ 𝑡 A
18 tgioo4 ⊢ topGen ⁡ ran ⁡ . = TopOpen ⁡ ℂ fld ↾ 𝑡 ℝ
19 16 17 18 cncfcn ⊢ A ⊆ ℂ ∧ ℝ ⊆ ℂ → A ⟶cn ℝ = TopOpen ⁡ ℂ fld ↾ 𝑡 A Cn topGen ⁡ ran ⁡ .
20 15 14 19 sylancl ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → A ⟶cn ℝ = TopOpen ⁡ ℂ fld ↾ 𝑡 A Cn topGen ⁡ ran ⁡ .
21 eqid ⊢ topGen ⁡ ran ⁡ . = topGen ⁡ ran ⁡ .
22 16 21 rerest ⊢ A ⊆ ℝ → TopOpen ⁡ ℂ fld ↾ 𝑡 A = topGen ⁡ ran ⁡ . ↾ 𝑡 A
23 13 22 syl ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → TopOpen ⁡ ℂ fld ↾ 𝑡 A = topGen ⁡ ran ⁡ . ↾ 𝑡 A
24 23 oveq1d ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → TopOpen ⁡ ℂ fld ↾ 𝑡 A Cn topGen ⁡ ran ⁡ . = topGen ⁡ ran ⁡ . ↾ 𝑡 A Cn topGen ⁡ ran ⁡ .
25 20 24 eqtrd ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → A ⟶cn ℝ = topGen ⁡ ran ⁡ . ↾ 𝑡 A Cn topGen ⁡ ran ⁡ .
26 12 25 eleqtrd ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℜ ∘ F ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A Cn topGen ⁡ ran ⁡ .
27 retopbas ⊢ ran ⁡ . ∈ TopBases
28 bastg ⊢ ran ⁡ . ∈ TopBases → ran ⁡ . ⊆ topGen ⁡ ran ⁡ .
29 27 28 ax-mp ⊢ ran ⁡ . ⊆ topGen ⁡ ran ⁡ .
30 simpr ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → x ∈ ran ⁡ .
31 29 30 sselid ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → x ∈ topGen ⁡ ran ⁡ .
32 cnima ⊢ ℜ ∘ F ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A Cn topGen ⁡ ran ⁡ . ∧ x ∈ topGen ⁡ ran ⁡ . → ℜ ∘ F -1 x ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A
33 26 31 32 syl2anc ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℜ ∘ F -1 x ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A
34 eqid ⊢ topGen ⁡ ran ⁡ . ↾ 𝑡 A = topGen ⁡ ran ⁡ . ↾ 𝑡 A
35 34 subopnmbl ⊢ A ∈ dom ⁡ vol ∧ ℜ ∘ F -1 x ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A → ℜ ∘ F -1 x ∈ dom ⁡ vol
36 8 33 35 syl2anc ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℜ ∘ F -1 x ∈ dom ⁡ vol
37 imcncf ⊢ ℑ : ℂ ⟶cn ℝ
38 37 a1i ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℑ : ℂ ⟶cn ℝ
39 9 38 cncfco ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℑ ∘ F : A ⟶cn ℝ
40 39 25 eleqtrd ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℑ ∘ F ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A Cn topGen ⁡ ran ⁡ .
41 cnima ⊢ ℑ ∘ F ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A Cn topGen ⁡ ran ⁡ . ∧ x ∈ topGen ⁡ ran ⁡ . → ℑ ∘ F -1 x ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A
42 40 31 41 syl2anc ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℑ ∘ F -1 x ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A
43 34 subopnmbl ⊢ A ∈ dom ⁡ vol ∧ ℑ ∘ F -1 x ∈ topGen ⁡ ran ⁡ . ↾ 𝑡 A → ℑ ∘ F -1 x ∈ dom ⁡ vol
44 8 42 43 syl2anc ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℑ ∘ F -1 x ∈ dom ⁡ vol
45 36 44 jca ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ ∧ x ∈ ran ⁡ . → ℜ ∘ F -1 x ∈ dom ⁡ vol ∧ ℑ ∘ F -1 x ∈ dom ⁡ vol
46 45 ralrimiva ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ → ∀ x ∈ ran ⁡ . ℜ ∘ F -1 x ∈ dom ⁡ vol ∧ ℑ ∘ F -1 x ∈ dom ⁡ vol
47 ismbf1 ⊢ F ∈ MblFn ↔ F ∈ ℂ ↑ 𝑝𝑚 ℝ ∧ ∀ x ∈ ran ⁡ . ℜ ∘ F -1 x ∈ dom ⁡ vol ∧ ℑ ∘ F -1 x ∈ dom ⁡ vol
48 7 46 47 sylanbrc ⊢ A ∈ dom ⁡ vol ∧ F : A ⟶cn ℂ → F ∈ MblFn