Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sitgfval Structured version   Visualization version   GIF version

Theorem sitgfval 34447
Description: Value of the Bochner integral for a simple function 𝐹. (Contributed by Thierry Arnoux, 30-Jan-2018.)
Hypotheses
Ref Expression
sitgval.b 𝐵 = (Base‘𝑊)
sitgval.j 𝐽 = (TopOpen‘𝑊)
sitgval.s 𝑆 = (sigaGen‘𝐽)
sitgval.0 0 = (0g𝑊)
sitgval.x · = ( ·𝑠𝑊)
sitgval.h 𝐻 = (ℝHom‘(Scalar‘𝑊))
sitgval.1 (𝜑𝑊𝑉)
sitgval.2 (𝜑𝑀 ran measures)
sibfmbl.1 (𝜑𝐹 ∈ dom (𝑊sitg𝑀))
Assertion
Ref Expression
sitgfval (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
Distinct variable groups:   𝑥,𝐹   𝑥,𝑀   𝑥,𝑊   𝑥, 0   𝜑,𝑥
Allowed substitution hints:   𝐵(𝑥)   𝑆(𝑥)   · (𝑥)   𝐻(𝑥)   𝐽(𝑥)   𝑉(𝑥)

Proof of Theorem sitgfval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sitgval.b . . 3 𝐵 = (Base‘𝑊)
2 sitgval.j . . 3 𝐽 = (TopOpen‘𝑊)
3 sitgval.s . . 3 𝑆 = (sigaGen‘𝐽)
4 sitgval.0 . . 3 0 = (0g𝑊)
5 sitgval.x . . 3 · = ( ·𝑠𝑊)
6 sitgval.h . . 3 𝐻 = (ℝHom‘(Scalar‘𝑊))
7 sitgval.1 . . 3 (𝜑𝑊𝑉)
8 sitgval.2 . . 3 (𝜑𝑀 ran measures)
91, 2, 3, 4, 5, 6, 7, 8sitgval 34438 . 2 (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)))))
10 simpr 484 . . . . . 6 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1110rneqd 5885 . . . . 5 ((𝜑𝑓 = 𝐹) → ran 𝑓 = ran 𝐹)
1211difeq1d 4075 . . . 4 ((𝜑𝑓 = 𝐹) → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
1310cnveqd 5822 . . . . . . . 8 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1413imaeq1d 6016 . . . . . . 7 ((𝜑𝑓 = 𝐹) → (𝑓 “ {𝑥}) = (𝐹 “ {𝑥}))
1514fveq2d 6836 . . . . . 6 ((𝜑𝑓 = 𝐹) → (𝑀‘(𝑓 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
1615fveq2d 6836 . . . . 5 ((𝜑𝑓 = 𝐹) → (𝐻‘(𝑀‘(𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(𝐹 “ {𝑥}))))
1716oveq1d 7371 . . . 4 ((𝜑𝑓 = 𝐹) → ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))
1812, 17mpteq12dv 5183 . . 3 ((𝜑𝑓 = 𝐹) → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥)))
1918oveq2d 7372 . 2 ((𝜑𝑓 = 𝐹) → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
20 sibfmbl.1 . . . . 5 (𝜑𝐹 ∈ dom (𝑊sitg𝑀))
211, 2, 3, 4, 5, 6, 7, 8, 20sibfmbl 34441 . . . 4 (𝜑𝐹 ∈ (dom 𝑀MblFnM𝑆))
221, 2, 3, 4, 5, 6, 7, 8, 20sibfrn 34443 . . . 4 (𝜑 → ran 𝐹 ∈ Fin)
231, 2, 3, 4, 5, 6, 7, 8, 20sibfima 34444 . . . . 5 ((𝜑𝑥 ∈ (ran 𝐹 ∖ { 0 })) → (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2423ralrimiva 3126 . . . 4 (𝜑 → ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2521, 22, 24jca32 515 . . 3 (𝜑 → (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
26 rneq 5883 . . . . . 6 (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
2726eleq1d 2819 . . . . 5 (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
2826difeq1d 4075 . . . . . 6 (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
29 cnveq 5820 . . . . . . . . 9 (𝑔 = 𝐹𝑔 = 𝐹)
3029imaeq1d 6016 . . . . . . . 8 (𝑔 = 𝐹 → (𝑔 “ {𝑥}) = (𝐹 “ {𝑥}))
3130fveq2d 6836 . . . . . . 7 (𝑔 = 𝐹 → (𝑀‘(𝑔 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
3231eleq1d 2819 . . . . . 6 (𝑔 = 𝐹 → ((𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3328, 32raleqbidv 3314 . . . . 5 (𝑔 = 𝐹 → (∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3427, 33anbi12d 632 . . . 4 (𝑔 = 𝐹 → ((ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞)) ↔ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3534elrab 3644 . . 3 (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3625, 35sylibr 234 . 2 (𝜑𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))})
37 ovexd 7391 . 2 (𝜑 → (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))) ∈ V)
389, 19, 36, 37fvmptd 6946 1 (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3049  {crab 3397  Vcvv 3438  cdif 3896  {csn 4578   cuni 4861  cmpt 5177  ccnv 5621  dom cdm 5622  ran crn 5623  cima 5625  cfv 6490  (class class class)co 7356  Fincfn 8881  0cc0 11024  +∞cpnf 11161  [,)cico 13261  Basecbs 17134  Scalarcsca 17178   ·𝑠 cvsca 17179  TopOpenctopn 17339  0gc0g 17357   Σg cgsu 17358  ℝHomcrrh 34099  sigaGencsigagen 34244  measurescmeas 34301  MblFnMcmbfm 34355  sitgcsitg 34435
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-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-rep 5222  ax-sep 5239  ax-nul 5249  ax-pr 5375
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-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-iun 4946  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-ov 7359  df-oprab 7360  df-mpo 7361  df-sitg 34436
This theorem is referenced by:  sitgclg  34448  sitg0  34452
  Copyright terms: Public domain W3C validator