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 34640
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 34631 . 2 (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)))))
10 simpr 488 . . . . . 6 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1110rneqd 5916 . . . . 5 ((𝜑𝑓 = 𝐹) → ran 𝑓 = ran 𝐹)
1211difeq1d 4081 . . . 4 ((𝜑𝑓 = 𝐹) → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
1310cnveqd 5849 . . . . . . . 8 ((𝜑𝑓 = 𝐹) → 𝑓 = 𝐹)
1413imaeq1d 6050 . . . . . . 7 ((𝜑𝑓 = 𝐹) → (𝑓 “ {𝑥}) = (𝐹 “ {𝑥}))
1514fveq2d 6873 . . . . . 6 ((𝜑𝑓 = 𝐹) → (𝑀‘(𝑓 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
1615fveq2d 6873 . . . . 5 ((𝜑𝑓 = 𝐹) → (𝐻‘(𝑀‘(𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(𝐹 “ {𝑥}))))
1716oveq1d 7413 . . . 4 ((𝜑𝑓 = 𝐹) → ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))
1812, 17mpteq12dv 5189 . . 3 ((𝜑𝑓 = 𝐹) → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥)))
1918oveq2d 7414 . 2 ((𝜑𝑓 = 𝐹) → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
20 sibfmbl.1 . . . . 5 (𝜑𝐹 ∈ dom (𝑊sitg𝑀))
211, 2, 3, 4, 5, 6, 7, 8, 20sibfmbl 34634 . . . 4 (𝜑𝐹 ∈ (dom 𝑀MblFnM𝑆))
221, 2, 3, 4, 5, 6, 7, 8, 20sibfrn 34636 . . . 4 (𝜑 → ran 𝐹 ∈ Fin)
231, 2, 3, 4, 5, 6, 7, 8, 20sibfima 34637 . . . . 5 ((𝜑𝑥 ∈ (ran 𝐹 ∖ { 0 })) → (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2423ralrimiva 3156 . . . 4 (𝜑 → ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))
2521, 22, 24jca32 523 . . 3 (𝜑 → (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
26 rneq 5914 . . . . . 6 (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
2726eleq1d 2849 . . . . 5 (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
2826difeq1d 4081 . . . . . 6 (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
29 cnveq 5847 . . . . . . . . 9 (𝑔 = 𝐹𝑔 = 𝐹)
3029imaeq1d 6050 . . . . . . . 8 (𝑔 = 𝐹 → (𝑔 “ {𝑥}) = (𝐹 “ {𝑥}))
3130fveq2d 6873 . . . . . . 7 (𝑔 = 𝐹 → (𝑀‘(𝑔 “ {𝑥})) = (𝑀‘(𝐹 “ {𝑥})))
3231eleq1d 2849 . . . . . 6 (𝑔 = 𝐹 → ((𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ (𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3328, 32raleqbidv 3338 . . . . 5 (𝑔 = 𝐹 → (∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞)))
3427, 33anbi12d 641 . . . 4 (𝑔 = 𝐹 → ((ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞)) ↔ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3534elrab 3652 . . 3 (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(𝐹 “ {𝑥})) ∈ (0[,)+∞))))
3625, 35sylibr 236 . 2 (𝜑𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(𝑔 “ {𝑥})) ∈ (0[,)+∞))})
37 ovexd 7433 . 2 (𝜑 → (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))) ∈ V)
389, 19, 36, 37fvmptd 6985 1 (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(𝐹 “ {𝑥}))) · 𝑥))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399   = wceq 1562  wcel 2144  wral 3078  {crab 3416  Vcvv 3456  cdif 3903  {csn 4584   cuni 4867  cmpt 5183  ccnv 5648  dom cdm 5649  ran crn 5650  cima 5652  cfv 6523  (class class class)co 7398  Fincfn 8929  0cc0 11075  +∞cpnf 11215  [,)cico 13353  Basecbs 17247  Scalarcsca 17291   ·𝑠 cvsca 17292  TopOpenctopn 17452  0gc0g 17470   Σg cgsu 17471  ℝHomcrrh 34292  sigaGencsigagen 34437  measurescmeas 34494  MblFnMcmbfm 34548  sitgcsitg 34628
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3079  df-rex 3089  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-ov 7401  df-oprab 7402  df-mpo 7403  df-sitg 34629
This theorem is referenced by:  sitgclg  34641  sitg0  34645
  Copyright terms: Public domain W3C validator