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 32357
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 32348 . 2 (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)))))
10 simpr 486 . . . . . 6 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1110rneqd 5859 . . . . 5 ((𝜑𝑓 = 𝐹) → ran 𝑓 = ran 𝐹)
1211difeq1d 4062 . . . 4 ((𝜑𝑓 = 𝐹) → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
1310cnveqd 5797 . . . . . . . 8 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1413imaeq1d 5978 . . . . . . 7 ((𝜑𝑓 = 𝐹) → (𝑓 “ {𝑥}) = (𝐹 “ {𝑥}))
1514fveq2d 6808 . . . . . 6 ((𝜑𝑓 = 𝐹) → (𝑀‘(𝑓 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
1615fveq2d 6808 . . . . 5 ((𝜑𝑓 = 𝐹) → (𝐻‘(𝑀‘(𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(𝐹 “ {𝑥}))))
1716oveq1d 7322 . . . 4 ((𝜑𝑓 = 𝐹) → ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))
1812, 17mpteq12dv 5172 . . 3 ((𝜑𝑓 = 𝐹) → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥)))
1918oveq2d 7323 . 2 ((𝜑𝑓 = 𝐹) → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
20 sibfmbl.1 . . . . 5 (𝜑𝐹 ∈ dom (𝑊sitg𝑀))
211, 2, 3, 4, 5, 6, 7, 8, 20sibfmbl 32351 . . . 4 (𝜑𝐹 ∈ (dom 𝑀MblFnM𝑆))
221, 2, 3, 4, 5, 6, 7, 8, 20sibfrn 32353 . . . 4 (𝜑 → ran 𝐹 ∈ Fin)
231, 2, 3, 4, 5, 6, 7, 8, 20sibfima 32354 . . . . 5 ((𝜑𝑥 ∈ (ran 𝐹 ∖ { 0 })) → (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2423ralrimiva 3140 . . . 4 (𝜑 → ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2521, 22, 24jca32 517 . . 3 (𝜑 → (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
26 rneq 5857 . . . . . 6 (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
2726eleq1d 2821 . . . . 5 (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
2826difeq1d 4062 . . . . . 6 (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
29 cnveq 5795 . . . . . . . . 9 (𝑔 = 𝐹𝑔 = 𝐹)
3029imaeq1d 5978 . . . . . . . 8 (𝑔 = 𝐹 → (𝑔 “ {𝑥}) = (𝐹 “ {𝑥}))
3130fveq2d 6808 . . . . . . 7 (𝑔 = 𝐹 → (𝑀‘(𝑔 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
3231eleq1d 2821 . . . . . 6 (𝑔 = 𝐹 → ((𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3328, 32raleqbidv 3355 . . . . 5 (𝑔 = 𝐹 → (∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3427, 33anbi12d 632 . . . 4 (𝑔 = 𝐹 → ((ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞)) ↔ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3534elrab 3629 . . 3 (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3625, 35sylibr 233 . 2 (𝜑𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))})
37 ovexd 7342 . 2 (𝜑 → (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))) ∈ V)
389, 19, 36, 37fvmptd 6914 1 (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1539  wcel 2104  wral 3062  {crab 3303  Vcvv 3437  cdif 3889  {csn 4565   cuni 4844  cmpt 5164  ccnv 5599  dom cdm 5600  ran crn 5601  cima 5603  cfv 6458  (class class class)co 7307  Fincfn 8764  0cc0 10921  +∞cpnf 11056  [,)cico 13131  Basecbs 16961  Scalarcsca 17014   ·𝑠 cvsca 17015  TopOpenctopn 17181  0gc0g 17199   Σg cgsu 17200  ℝHomcrrh 31992  sigaGencsigagen 32155  measurescmeas 32212  MblFnMcmbfm 32266  sitgcsitg 32345
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-rep 5218  ax-sep 5232  ax-nul 5239  ax-pr 5361
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3305  df-rab 3306  df-v 3439  df-sbc 3722  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-iun 4933  df-br 5082  df-opab 5144  df-mpt 5165  df-id 5500  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-f1 6463  df-fo 6464  df-f1o 6465  df-fv 6466  df-ov 7310  df-oprab 7311  df-mpo 7312  df-sitg 32346
This theorem is referenced by:  sitgclg  32358  sitg0  32362
  Copyright terms: Public domain W3C validator