Theorem sitgfval 34973

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 34964	. 2 ⊢ (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)))))
10		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
11	10	rneqd 5919	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ran 𝑓 = ran 𝐹)
12	11	difeq1d 4062	. . . 4 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
13	10	cnveqd 5852	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ◡𝑓 = ◡𝐹)
14	13	imaeq1d 6050	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (◡𝑓 “ {𝑥}) = (◡𝐹 “ {𝑥}))
15	14	fveq2d 6889	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑀‘(◡𝑓 “ {𝑥})) = (𝑀‘(◡𝐹 “ {𝑥})))
16	15	fveq2d 6889	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))))
17	16	oveq1d 7435	. . . 4 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))
18	12, 17	mpteq12dv 5191	. . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥)))
19	18	oveq2d 7436	. 2 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))))
20		sibfmbl.1	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ dom (𝑊sitg𝑀))
21	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfmbl 34967	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (dom 𝑀MblFnM𝑆))
22	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfrn 34969	. . . 4 ⊢ (𝜑 → ran 𝐹 ∈ Fin)
23	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfima 34970	. . . . 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 5917	. . . . . 6 ⊢ (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
27	26	eleq1d 2845	. . . . 5 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
28	26	difeq1d 4062	. . . . . 6 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
29		cnveq 5850	. . . . . . . . 9 ⊢ (𝑔 = 𝐹 → ◡𝑔 = ◡𝐹)
30	29	imaeq1d 6050	. . . . . . . 8 ⊢ (𝑔 = 𝐹 → (◡𝑔 “ {𝑥}) = (◡𝐹 “ {𝑥}))
31	30	fveq2d 6889	. . . . . . 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 3644	. . 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 7455	. 2 ⊢ (𝜑 → (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V)
38	9, 19, 36, 37	fvmptd 7001	1 ⊢ (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450   ∖ cdif 4045  {csn 4583  ∪ cuni 4866   ↦ cmpt 5185  ^◡ccnv 5649  dom cdm 5650  ran crn 5651   “ cima 5653  ‘cfv 6538  (class class class)co 7420  Fincfn 8973  0cc0 11200  +∞cpnf 11340  [,)cico 13478  Basecbs 17387  Scalarcsca 17431   ·_𝑠 cvsca 17432  TopOpenctopn 17592  0_gc0g 17610   Σ_g cgsu 17611  ℝHomcrrh 34625  sigaGencsigagen 34771  measurescmeas 34828  MblFnMcmbfm 34882  sitgcsitg 34961

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-sitg 34962

This theorem is used by:  sitgclg  34974  sitg0  34978