MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ismbf1 Structured version   Visualization version   GIF version

Theorem ismbf1 25581
Description: The predicate "𝐹 is a measurable function". This is more naturally stated for functions on the reals, see ismbf 25585 and ismbfcn 25586 for the decomposition of the real and imaginary parts. (Contributed by Mario Carneiro, 17-Jun-2014.)
Assertion
Ref Expression
ismbf1 (𝐹 ∈ MblFn ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ ∀𝑥 ∈ ran (,)(((ℜ ∘ 𝐹) “ 𝑥) ∈ dom vol ∧ ((ℑ ∘ 𝐹) “ 𝑥) ∈ dom vol)))
Distinct variable group:   𝑥,𝐹

Proof of Theorem ismbf1
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 coeq2 5807 . . . . . . 7 (𝑓 = 𝐹 → (ℜ ∘ 𝑓) = (ℜ ∘ 𝐹))
21cnveqd 5824 . . . . . 6 (𝑓 = 𝐹(ℜ ∘ 𝑓) = (ℜ ∘ 𝐹))
32imaeq1d 6018 . . . . 5 (𝑓 = 𝐹 → ((ℜ ∘ 𝑓) “ 𝑥) = ((ℜ ∘ 𝐹) “ 𝑥))
43eleq1d 2821 . . . 4 (𝑓 = 𝐹 → (((ℜ ∘ 𝑓) “ 𝑥) ∈ dom vol ↔ ((ℜ ∘ 𝐹) “ 𝑥) ∈ dom vol))
5 coeq2 5807 . . . . . . 7 (𝑓 = 𝐹 → (ℑ ∘ 𝑓) = (ℑ ∘ 𝐹))
65cnveqd 5824 . . . . . 6 (𝑓 = 𝐹(ℑ ∘ 𝑓) = (ℑ ∘ 𝐹))
76imaeq1d 6018 . . . . 5 (𝑓 = 𝐹 → ((ℑ ∘ 𝑓) “ 𝑥) = ((ℑ ∘ 𝐹) “ 𝑥))
87eleq1d 2821 . . . 4 (𝑓 = 𝐹 → (((ℑ ∘ 𝑓) “ 𝑥) ∈ dom vol ↔ ((ℑ ∘ 𝐹) “ 𝑥) ∈ dom vol))
94, 8anbi12d 632 . . 3 (𝑓 = 𝐹 → ((((ℜ ∘ 𝑓) “ 𝑥) ∈ dom vol ∧ ((ℑ ∘ 𝑓) “ 𝑥) ∈ dom vol) ↔ (((ℜ ∘ 𝐹) “ 𝑥) ∈ dom vol ∧ ((ℑ ∘ 𝐹) “ 𝑥) ∈ dom vol)))
109ralbidv 3159 . 2 (𝑓 = 𝐹 → (∀𝑥 ∈ ran (,)(((ℜ ∘ 𝑓) “ 𝑥) ∈ dom vol ∧ ((ℑ ∘ 𝑓) “ 𝑥) ∈ dom vol) ↔ ∀𝑥 ∈ ran (,)(((ℜ ∘ 𝐹) “ 𝑥) ∈ dom vol ∧ ((ℑ ∘ 𝐹) “ 𝑥) ∈ dom vol)))
11 df-mbf 25576 . 2 MblFn = {𝑓 ∈ (ℂ ↑pm ℝ) ∣ ∀𝑥 ∈ ran (,)(((ℜ ∘ 𝑓) “ 𝑥) ∈ dom vol ∧ ((ℑ ∘ 𝑓) “ 𝑥) ∈ dom vol)}
1210, 11elrab2 3649 1 (𝐹 ∈ MblFn ↔ (𝐹 ∈ (ℂ ↑pm ℝ) ∧ ∀𝑥 ∈ ran (,)(((ℜ ∘ 𝐹) “ 𝑥) ∈ dom vol ∧ ((ℑ ∘ 𝐹) “ 𝑥) ∈ dom vol)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3051  ccnv 5623  dom cdm 5624  ran crn 5625  cima 5627  ccom 5628  (class class class)co 7358  pm cpm 8764  cc 11024  cr 11025  (,)cioo 13261  cre 15020  cim 15021  volcvol 25420  MblFncmbf 25571
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-mbf 25576
This theorem is referenced by:  mbff  25582  mbfdm  25583  ismbf  25585  ismbfcn  25586  mbfconst  25590  mbfres  25601  cncombf  25615  cnmbf  25616  mbfdmssre  46244
  Copyright terms: Public domain W3C validator