| Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mbfres2cn | Structured version Visualization version GIF version | ||
| Description: Measurability of a piecewise function: if 𝐹 is measurable on subsets 𝐵 and 𝐶 of its domain, and these pieces make up all of 𝐴, then 𝐹 is measurable on the whole domain. Similar to mbfres2 25879 but here the theorem is extended to complex-valued functions. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
| Ref | Expression |
|---|---|
| mbfres2cn.f | ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
| mbfres2cn.b | ⊢ (𝜑 → (𝐹 ↾ 𝐵) ∈ MblFn) |
| mbfres2cn.c | ⊢ (𝜑 → (𝐹 ↾ 𝐶) ∈ MblFn) |
| mbfres2cn.a | ⊢ (𝜑 → (𝐵 ∪ 𝐶) = 𝐴) |
| Ref | Expression |
|---|---|
| mbfres2cn | ⊢ (𝜑 → 𝐹 ∈ MblFn) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ref 15203 | . . . 4 ⊢ ℜ:ℂ⟶ℝ | |
| 2 | mbfres2cn.f | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
| 3 | fco 6731 | . . . 4 ⊢ ((ℜ:ℂ⟶ℝ ∧ 𝐹:𝐴⟶ℂ) → (ℜ ∘ 𝐹):𝐴⟶ℝ) | |
| 4 | 1, 2, 3 | sylancr 599 | . . 3 ⊢ (𝜑 → (ℜ ∘ 𝐹):𝐴⟶ℝ) |
| 5 | resco 6250 | . . . 4 ⊢ ((ℜ ∘ 𝐹) ↾ 𝐵) = (ℜ ∘ (𝐹 ↾ 𝐵)) | |
| 6 | mbfres2cn.b | . . . . . 6 ⊢ (𝜑 → (𝐹 ↾ 𝐵) ∈ MblFn) | |
| 7 | fresin 6748 | . . . . . . 7 ⊢ (𝐹:𝐴⟶ℂ → (𝐹 ↾ 𝐵):(𝐴 ∩ 𝐵)⟶ℂ) | |
| 8 | ismbfcn 25863 | . . . . . . 7 ⊢ ((𝐹 ↾ 𝐵):(𝐴 ∩ 𝐵)⟶ℂ → ((𝐹 ↾ 𝐵) ∈ MblFn ↔ ((ℜ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn ∧ (ℑ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn))) | |
| 9 | 2, 7, 8 | 3syl 19 | . . . . . 6 ⊢ (𝜑 → ((𝐹 ↾ 𝐵) ∈ MblFn ↔ ((ℜ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn ∧ (ℑ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn))) |
| 10 | 6, 9 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ((ℜ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn ∧ (ℑ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn)) |
| 11 | 10 | simpld 500 | . . . 4 ⊢ (𝜑 → (ℜ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn) |
| 12 | 5, 11 | eqeltrid 2866 | . . 3 ⊢ (𝜑 → ((ℜ ∘ 𝐹) ↾ 𝐵) ∈ MblFn) |
| 13 | resco 6250 | . . . 4 ⊢ ((ℜ ∘ 𝐹) ↾ 𝐶) = (ℜ ∘ (𝐹 ↾ 𝐶)) | |
| 14 | mbfres2cn.c | . . . . . 6 ⊢ (𝜑 → (𝐹 ↾ 𝐶) ∈ MblFn) | |
| 15 | fresin 6748 | . . . . . . 7 ⊢ (𝐹:𝐴⟶ℂ → (𝐹 ↾ 𝐶):(𝐴 ∩ 𝐶)⟶ℂ) | |
| 16 | ismbfcn 25863 | . . . . . . 7 ⊢ ((𝐹 ↾ 𝐶):(𝐴 ∩ 𝐶)⟶ℂ → ((𝐹 ↾ 𝐶) ∈ MblFn ↔ ((ℜ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn ∧ (ℑ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn))) | |
| 17 | 2, 15, 16 | 3syl 19 | . . . . . 6 ⊢ (𝜑 → ((𝐹 ↾ 𝐶) ∈ MblFn ↔ ((ℜ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn ∧ (ℑ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn))) |
| 18 | 14, 17 | mpbid 235 | . . . . 5 ⊢ (𝜑 → ((ℜ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn ∧ (ℑ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn)) |
| 19 | 18 | simpld 500 | . . . 4 ⊢ (𝜑 → (ℜ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn) |
| 20 | 13, 19 | eqeltrid 2866 | . . 3 ⊢ (𝜑 → ((ℜ ∘ 𝐹) ↾ 𝐶) ∈ MblFn) |
| 21 | mbfres2cn.a | . . 3 ⊢ (𝜑 → (𝐵 ∪ 𝐶) = 𝐴) | |
| 22 | 4, 12, 20, 21 | mbfres2 25879 | . 2 ⊢ (𝜑 → (ℜ ∘ 𝐹) ∈ MblFn) |
| 23 | imf 15204 | . . . 4 ⊢ ℑ:ℂ⟶ℝ | |
| 24 | fco 6731 | . . . 4 ⊢ ((ℑ:ℂ⟶ℝ ∧ 𝐹:𝐴⟶ℂ) → (ℑ ∘ 𝐹):𝐴⟶ℝ) | |
| 25 | 23, 2, 24 | sylancr 599 | . . 3 ⊢ (𝜑 → (ℑ ∘ 𝐹):𝐴⟶ℝ) |
| 26 | resco 6250 | . . . 4 ⊢ ((ℑ ∘ 𝐹) ↾ 𝐵) = (ℑ ∘ (𝐹 ↾ 𝐵)) | |
| 27 | 10 | simprd 501 | . . . 4 ⊢ (𝜑 → (ℑ ∘ (𝐹 ↾ 𝐵)) ∈ MblFn) |
| 28 | 26, 27 | eqeltrid 2866 | . . 3 ⊢ (𝜑 → ((ℑ ∘ 𝐹) ↾ 𝐵) ∈ MblFn) |
| 29 | resco 6250 | . . . 4 ⊢ ((ℑ ∘ 𝐹) ↾ 𝐶) = (ℑ ∘ (𝐹 ↾ 𝐶)) | |
| 30 | 18 | simprd 501 | . . . 4 ⊢ (𝜑 → (ℑ ∘ (𝐹 ↾ 𝐶)) ∈ MblFn) |
| 31 | 29, 30 | eqeltrid 2866 | . . 3 ⊢ (𝜑 → ((ℑ ∘ 𝐹) ↾ 𝐶) ∈ MblFn) |
| 32 | 25, 28, 31, 21 | mbfres2 25879 | . 2 ⊢ (𝜑 → (ℑ ∘ 𝐹) ∈ MblFn) |
| 33 | ismbfcn 25863 | . . 3 ⊢ (𝐹:𝐴⟶ℂ → (𝐹 ∈ MblFn ↔ ((ℜ ∘ 𝐹) ∈ MblFn ∧ (ℑ ∘ 𝐹) ∈ MblFn))) | |
| 34 | 2, 33 | syl 18 | . 2 ⊢ (𝜑 → (𝐹 ∈ MblFn ↔ ((ℜ ∘ 𝐹) ∈ MblFn ∧ (ℑ ∘ 𝐹) ∈ MblFn))) |
| 35 | 22, 32, 34 | mpbir2and 726 | 1 ⊢ (𝜑 → 𝐹 ∈ MblFn) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∪ cun 3900 ∩ cin 3901 ↾ cres 5661 ∘ ccom 5663 ⟶wf 6533 ℂcc 11126 ℝcr 11127 ℜcre 15188 ℑcim 15189 MblFncmbf 25848 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-pre-sup 11206 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-of 7682 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-pm 8833 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-sup 9416 df-inf 9417 df-oi 9486 df-dju 9910 df-card 9948 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 df-nn 12262 df-2 12331 df-3 12332 df-n0 12533 df-z 12620 df-uz 12892 df-q 13002 df-rp 13047 df-xadd 13168 df-ioo 13406 df-ico 13408 df-icc 13409 df-fz 13566 df-fzo 13714 df-fl 13857 df-seq 14070 df-exp 14130 df-hash 14399 df-cj 15190 df-re 15191 df-im 15192 df-sqrt 15326 df-abs 15327 df-clim 15579 df-sum 15778 df-xmet 21584 df-met 21585 df-ovol 25698 df-vol 25699 df-mbf 25853 |
| This theorem is used by: iblsplit 46802 |
| Copyright terms: Public domain | W3C validator |