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 31709
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 31700 . 2 (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)))))
10 simpr 488 . . . . . 6 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1110rneqd 5772 . . . . 5 ((𝜑𝑓 = 𝐹) → ran 𝑓 = ran 𝐹)
1211difeq1d 4049 . . . 4 ((𝜑𝑓 = 𝐹) → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
1310cnveqd 5710 . . . . . . . 8 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1413imaeq1d 5895 . . . . . . 7 ((𝜑𝑓 = 𝐹) → (𝑓 “ {𝑥}) = (𝐹 “ {𝑥}))
1514fveq2d 6649 . . . . . 6 ((𝜑𝑓 = 𝐹) → (𝑀‘(𝑓 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
1615fveq2d 6649 . . . . 5 ((𝜑𝑓 = 𝐹) → (𝐻‘(𝑀‘(𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(𝐹 “ {𝑥}))))
1716oveq1d 7150 . . . 4 ((𝜑𝑓 = 𝐹) → ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))
1812, 17mpteq12dv 5115 . . 3 ((𝜑𝑓 = 𝐹) → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥)))
1918oveq2d 7151 . 2 ((𝜑𝑓 = 𝐹) → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
20 sibfmbl.1 . . . . 5 (𝜑𝐹 ∈ dom (𝑊sitg𝑀))
211, 2, 3, 4, 5, 6, 7, 8, 20sibfmbl 31703 . . . 4 (𝜑𝐹 ∈ (dom 𝑀MblFnM𝑆))
221, 2, 3, 4, 5, 6, 7, 8, 20sibfrn 31705 . . . 4 (𝜑 → ran 𝐹 ∈ Fin)
231, 2, 3, 4, 5, 6, 7, 8, 20sibfima 31706 . . . . 5 ((𝜑𝑥 ∈ (ran 𝐹 ∖ { 0 })) → (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2423ralrimiva 3149 . . . 4 (𝜑 → ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2521, 22, 24jca32 519 . . 3 (𝜑 → (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
26 rneq 5770 . . . . . 6 (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
2726eleq1d 2874 . . . . 5 (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
2826difeq1d 4049 . . . . . 6 (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
29 cnveq 5708 . . . . . . . . 9 (𝑔 = 𝐹𝑔 = 𝐹)
3029imaeq1d 5895 . . . . . . . 8 (𝑔 = 𝐹 → (𝑔 “ {𝑥}) = (𝐹 “ {𝑥}))
3130fveq2d 6649 . . . . . . 7 (𝑔 = 𝐹 → (𝑀‘(𝑔 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
3231eleq1d 2874 . . . . . 6 (𝑔 = 𝐹 → ((𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3328, 32raleqbidv 3354 . . . . 5 (𝑔 = 𝐹 → (∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3427, 33anbi12d 633 . . . 4 (𝑔 = 𝐹 → ((ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞)) ↔ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3534elrab 3628 . . 3 (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3625, 35sylibr 237 . 2 (𝜑𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))})
37 ovexd 7170 . 2 (𝜑 → (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))) ∈ V)
389, 19, 36, 37fvmptd 6752 1 (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1538  wcel 2111  wral 3106  {crab 3110  Vcvv 3441  cdif 3878  {csn 4525   cuni 4800  cmpt 5110  ccnv 5518  dom cdm 5519  ran crn 5520  cima 5522  cfv 6324  (class class class)co 7135  Fincfn 8492  0cc0 10526  +∞cpnf 10661  [,)cico 12728  Basecbs 16475  Scalarcsca 16560   ·𝑠 cvsca 16561  TopOpenctopn 16687  0gc0g 16705   Σg cgsu 16706  ℝHomcrrh 31344  sigaGencsigagen 31507  measurescmeas 31564  MblFnMcmbfm 31618  sitgcsitg 31697
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-ov 7138  df-oprab 7139  df-mpo 7140  df-sitg 31698
This theorem is referenced by:  sitgclg  31710  sitg0  31714
  Copyright terms: Public domain W3C validator