Theorem sitgfval 35040

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 35031	. 2 ⊢ (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)))))
10		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → 𝑓 = 𝐹)
11	10	rneqd 5926	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ran 𝑓 = ran 𝐹)
12	11	difeq1d 4065	. . . 4 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
13	10	cnveqd 5859	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ◡𝑓 = ◡𝐹)
14	13	imaeq1d 6062	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (◡𝑓 “ {𝑥}) = (◡𝐹 “ {𝑥}))
15	14	fveq2d 6909	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑀‘(◡𝑓 “ {𝑥})) = (𝑀‘(◡𝐹 “ {𝑥})))
16	15	fveq2d 6909	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))))
17	16	oveq1d 7455	. . . 4 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))
18	12, 17	mpteq12dv 5195	. . 3 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥)))
19	18	oveq2d 7456	. 2 ⊢ ((𝜑 ∧ 𝑓 = 𝐹) → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))))
20		sibfmbl.1	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ dom (𝑊sitg𝑀))
21	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfmbl 35034	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (dom 𝑀MblFnM𝑆))
22	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfrn 35036	. . . 4 ⊢ (𝜑 → ran 𝐹 ∈ Fin)
23	1, 2, 3, 4, 5, 6, 7, 8, 20	sibfima 35037	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (ran 𝐹 ∖ { 0 })) → (𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))
24	23	ralrimiva 3158	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))
25	21, 22, 24	jca32 525	. . 3 ⊢ (𝜑 → (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))
26		rneq 5924	. . . . . 6 ⊢ (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
27	26	eleq1d 2849	. . . . 5 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
28	26	difeq1d 4065	. . . . . 6 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
29		cnveq 5857	. . . . . . . . 9 ⊢ (𝑔 = 𝐹 → ◡𝑔 = ◡𝐹)
30	29	imaeq1d 6062	. . . . . . . 8 ⊢ (𝑔 = 𝐹 → (◡𝑔 “ {𝑥}) = (◡𝐹 “ {𝑥}))
31	30	fveq2d 6909	. . . . . . 7 ⊢ (𝑔 = 𝐹 → (𝑀‘(◡𝑔 “ {𝑥})) = (𝑀‘(◡𝐹 “ {𝑥})))
32	31	eleq1d 2849	. . . . . 6 ⊢ (𝑔 = 𝐹 → ((𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ (𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞)))
33	28, 32	raleqbidv 3338	. . . . 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 3648	. . 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 7475	. 2 ⊢ (𝜑 → (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V)
38	9, 19, 36, 37	fvmptd 7021	1 ⊢ (𝜑 → ((𝑊sitg𝑀)‘𝐹) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ∖ cdif 4048  {csn 4588  ∪ cuni 4870   ↦ cmpt 5189  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658  ‘cfv 6555  (class class class)co 7440  Fincfn 8998  0cc0 11224  +∞cpnf 11364  [,)cico 13502  Basecbs 17413  Scalarcsca 17457   ·_𝑠 cvsca 17458  TopOpenctopn 17618  0_gc0g 17636   Σ_g cgsu 17637  ℝHomcrrh 34692  sigaGencsigagen 34838  measurescmeas 34895  MblFnMcmbfm 34949  sitgcsitg 35028

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-sitg 35029

This theorem is used by:  sitgclg  35041  sitg0  35045