Theorem sitgfval 34885

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.

Step	Hyp	Ref	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)
9	1, 2, 3, 4, 5, 6, 7, 8	sitgval 34876	. 2 ⊢ (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)))))
10		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
11	10	rneqd 5924	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ran 𝑓 = ran 𝐹)
12	11	difeq1d 4073	. . . 4 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
13	10	cnveqd 5857	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ◡𝑓 = ◡𝐹)
14	13	imaeq1d 6057	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (◡𝑓 “ {𝑥}) = (◡𝐹 “ {𝑥}))
15	14	fveq2d 6885	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑀‘(◡𝑓 “ {𝑥})) = (𝑀‘(◡𝐹 “ {𝑥})))
16	15	fveq2d 6885	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))))
17	16	oveq1d 7431	. . . 4 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))
18	12, 17	mpteq12dv 5192	. . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥)))
19	18	oveq2d 7432	. 2 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))))
20		sibfmbl.1	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ dom (𝑊sitg𝑀))
21	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfmbl 34879	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (dom 𝑀MblFnM𝑆))
22	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfrn 34881	. . . 4 ⊢ (𝜑 → ran 𝐹 ∈ Fin)
23	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfima 34882	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ran 𝐹 ∖ { 0 })) → (𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))
24	23	ralrimiva 3154	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))
25	21, 22, 24	jca32 525	. . 3 ⊢ (𝜑 → (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))
26		rneq 5922	. . . . . 6 ⊢ (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
27	26	eleq1d 2845	. . . . 5 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
28	26	difeq1d 4073	. . . . . 6 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
29		cnveq 5855	. . . . . . . . 9 ⊢ (𝑔 = 𝐹 → ◡𝑔 = ◡𝐹)
30	29	imaeq1d 6057	. . . . . . . 8 ⊢ (𝑔 = 𝐹 → (◡𝑔 “ {𝑥}) = (◡𝐹 “ {𝑥}))
31	30	fveq2d 6885	. . . . . . 7 ⊢ (𝑔 = 𝐹 → (𝑀‘(◡𝑔 “ {𝑥})) = (𝑀‘(◡𝐹 “ {𝑥})))
32	31	eleq1d 2845	. . . . . 6 ⊢ (𝑔 = 𝐹 → ((𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ (𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞)))
33	28, 32	raleqbidv 3334	. . . . 5 ⊢ (𝑔 = 𝐹 → (∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞)))
34	27, 33	anbi12d 644	. . . 4 ⊢ (𝑔 = 𝐹 → ((ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞)) ↔ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))
35	34	elrab 3645	. . 3 ⊢ (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))
36	25, 35	sylibr 237	. 2 ⊢ (𝜑 → 𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))})
37		ovexd 7451	. 2 ⊢ (𝜑 → (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V)
38	9, 19, 36, 37	fvmptd 6997	1 ⊢ (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  {crab 3412  Vcvv 3450   ∖ cdif 3896  {csn 4584  ∪ cuni 4867   ↦ cmpt 5186  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658  ‘cfv 6535  (class class class)co 7416  Fincfn 8959  0cc0 11149  +∞cpnf 11289  [,)cico 13425  Basecbs 17326  Scalarcsca 17370   ·_𝑠 cvsca 17371  TopOpenctopn 17531  0_gc0g 17549   Σ_g cgsu 17550  ℝHomcrrh 34536  sigaGencsigagen 34682  measurescmeas 34739  MblFnMcmbfm 34793  sitgcsitg 34873

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-ov 7419  df-oprab 7420  df-mpo 7421  df-sitg 34874

This theorem is used by:  sitgclg  34886  sitg0  34890