Theorem issibf 34790

Description: The predicate "𝐹 is a simple function" relative to the Bochner integral. (Contributed by Thierry Arnoux, 19-Feb-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)

Assertion

Ref	Expression
issibf	⊢ (𝜑 → (𝐹 ∈ dom (𝑊sitg𝑀) ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))

Distinct variable groups:   𝑥,𝐹   𝑥,𝑀   𝑥,𝑊   𝑥, 0

Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥)   𝑆(𝑥)   · (𝑥)   𝐻(𝑥)   𝐽(𝑥)   𝑉(𝑥)

Proof of Theorem issibf

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sitgval.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑊)
2		sitgval.j	. . . . . . . . 9 ⊢ 𝐽 = (TopOpen‘𝑊)
3		sitgval.s	. . . . . . . . 9 ⊢ 𝑆 = (sigaGen‘𝐽)
4		sitgval.0	. . . . . . . . 9 ⊢ 0 = (0g‘𝑊)
5		sitgval.x	. . . . . . . . 9 ⊢ · = ( ·𝑠 ‘𝑊)
6		sitgval.h	. . . . . . . . 9 ⊢ 𝐻 = (ℝHom‘(Scalar‘𝑊))
7		sitgval.1	. . . . . . . . 9 ⊢ (𝜑 → 𝑊 ∈ 𝑉)
8		sitgval.2	. . . . . . . . 9 ⊢ (𝜑 → 𝑀 ∈ ∪ ran measures)
9	1, 2, 3, 4, 5, 6, 7, 8	sitgval 34789	. . . . . . . 8 ⊢ (𝜑 → (𝑊sitg𝑀) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)))))
10	9	dmeqd 5897	. . . . . . 7 ⊢ (𝜑 → dom (𝑊sitg𝑀) = dom (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)))))
11		eqid 2765	. . . . . . . 8 ⊢ (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)))) = (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))))
12	11	dmmpt 6243	. . . . . . 7 ⊢ dom (𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↦ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)))) = {𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ∣ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) ∈ V}
13	10, 12	eqtrdi 2816	. . . . . 6 ⊢ (𝜑 → dom (𝑊sitg𝑀) = {𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ∣ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) ∈ V})
14	13	eleq2d 2851	. . . . 5 ⊢ (𝜑 → (𝐹 ∈ dom (𝑊sitg𝑀) ↔ 𝐹 ∈ {𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ∣ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) ∈ V}))
15		rneq 5928	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → ran 𝑓 = ran 𝐹)
16	15	difeq1d 4080	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (ran 𝑓 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
17		cnveq 5861	. . . . . . . . . . . . 13 ⊢ (𝑓 = 𝐹 → ◡𝑓 = ◡𝐹)
18	17	imaeq1d 6063	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝐹 → (◡𝑓 “ {𝑥}) = (◡𝐹 “ {𝑥}))
19	18	fveq2d 6889	. . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → (𝑀‘(◡𝑓 “ {𝑥})) = (𝑀‘(◡𝐹 “ {𝑥})))
20	19	fveq2d 6889	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) = (𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))))
21	20	oveq1d 7434	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥) = ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))
22	16, 21	mpteq12dv 5200	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥)) = (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥)))
23	22	oveq2d 7435	. . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) = (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))))
24	23	eleq1d 2850	. . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) ∈ V ↔ (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V))
25	24	elrab 3652	. . . . 5 ⊢ (𝐹 ∈ {𝑓 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ∣ (𝑊 Σg (𝑥 ∈ (ran 𝑓 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝑓 “ {𝑥}))) · 𝑥))) ∈ V} ↔ (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ∧ (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V))
26	14, 25	bitrdi 290	. . . 4 ⊢ (𝜑 → (𝐹 ∈ dom (𝑊sitg𝑀) ↔ (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ∧ (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V)))
27		ovex 7452	. . . . 5 ⊢ (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V
28	27	biantru 539	. . . 4 ⊢ (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↔ (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ∧ (𝑊 Σg (𝑥 ∈ (ran 𝐹 ∖ { 0 }) ↦ ((𝐻‘(𝑀‘(◡𝐹 “ {𝑥}))) · 𝑥))) ∈ V))
29	26, 28	bitr4di 292	. . 3 ⊢ (𝜑 → (𝐹 ∈ dom (𝑊sitg𝑀) ↔ 𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))}))
30		rneq 5928	. . . . . 6 ⊢ (𝑔 = 𝐹 → ran 𝑔 = ran 𝐹)
31	30	eleq1d 2850	. . . . 5 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∈ Fin ↔ ran 𝐹 ∈ Fin))
32	30	difeq1d 4080	. . . . . 6 ⊢ (𝑔 = 𝐹 → (ran 𝑔 ∖ { 0 }) = (ran 𝐹 ∖ { 0 }))
33		cnveq 5861	. . . . . . . . 9 ⊢ (𝑔 = 𝐹 → ◡𝑔 = ◡𝐹)
34	33	imaeq1d 6063	. . . . . . . 8 ⊢ (𝑔 = 𝐹 → (◡𝑔 “ {𝑥}) = (◡𝐹 “ {𝑥}))
35	34	fveq2d 6889	. . . . . . 7 ⊢ (𝑔 = 𝐹 → (𝑀‘(◡𝑔 “ {𝑥})) = (𝑀‘(◡𝐹 “ {𝑥})))
36	35	eleq1d 2850	. . . . . 6 ⊢ (𝑔 = 𝐹 → ((𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ (𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞)))
37	32, 36	raleqbidv 3340	. . . . 5 ⊢ (𝑔 = 𝐹 → (∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞) ↔ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞)))
38	31, 37	anbi12d 644	. . . 4 ⊢ (𝑔 = 𝐹 → ((ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞)) ↔ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))
39	38	elrab 3652	. . 3 ⊢ (𝐹 ∈ {𝑔 ∈ (dom 𝑀MblFnM𝑆) ∣ (ran 𝑔 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝑔 ∖ { 0 })(𝑀‘(◡𝑔 “ {𝑥})) ∈ (0[,)+∞))} ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))
40	29, 39	bitrdi 290	. 2 ⊢ (𝜑 → (𝐹 ∈ dom (𝑊sitg𝑀) ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞)))))
41		3anass 1111	. 2 ⊢ ((𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞)) ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ (ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))
42	40, 41	bitr4di 292	1 ⊢ (𝜑 → (𝐹 ∈ dom (𝑊sitg𝑀) ↔ (𝐹 ∈ (dom 𝑀MblFnM𝑆) ∧ ran 𝐹 ∈ Fin ∧ ∀𝑥 ∈ (ran 𝐹 ∖ { 0 })(𝑀‘(◡𝐹 “ {𝑥})) ∈ (0[,)+∞))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∀wral 3081  {crab 3418  Vcvv 3457   ∖ cdif 3903  {csn 4591  ∪ cuni 4874   ↦ cmpt 5194  ^◡ccnv 5662  dom cdm 5663  ran crn 5664   “ cima 5666  ‘cfv 6540  (class class class)co 7419  Fincfn 8949  0cc0 11117  +∞cpnf 11257  [,)cico 13392  Basecbs 17293  Scalarcsca 17337   ·_𝑠 cvsca 17338  TopOpenctopn 17498  0_gc0g 17516   Σ_g cgsu 17517  ℝHomcrrh 34449  sigaGencsigagen 34595  measurescmeas 34652  MblFnMcmbfm 34706  sitgcsitg 34786

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pr 5406

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-sitg 34787

This theorem is used by:  sibf0  34791  sibfmbl  34792  sibfrn  34794  sibfima  34795  sibfof  34797