meadjiunlem - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > meadjiunlem		Structured version Visualization version GIF version

Theorem meadjiunlem 43893

Description: The sum of nonnegative extended reals, restricted to the range of another function. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

**Hypotheses**
Ref	Expression
meadjiunlem.f	⊢ (𝜑 → 𝑀 ∈ Meas)
meadjiunlem.3	⊢ 𝑆 = dom 𝑀
meadjiunlem.x	⊢ (𝜑 → 𝑋 ∈ 𝑉)
meadjiunlem.g	⊢ (𝜑 → 𝐺:𝑋⟶𝑆)
meadjiunlem.y	⊢ 𝑌 = {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅}
meadjiunlem.dj	⊢ (𝜑 → Disj 𝑖 ∈ 𝑋 (𝐺‘𝑖))

**Assertion**
Ref	Expression
meadjiunlem	⊢ (𝜑 → (Σ^{^}‘(𝑀 ↾ ran 𝐺)) = (Σ^{^}‘(𝑀 ∘ 𝐺)))

Distinct variable groups: 𝑖,𝐺 𝑖,𝑋 𝑖,𝑌 𝜑,𝑖 Allowed substitution hints: 𝑆(𝑖) 𝑀(𝑖) 𝑉(𝑖)

Proof of Theorem meadjiunlem Dummy variables 𝑗 𝑘 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1918	. . . 4 ⊢ Ⅎ𝑘𝜑
2		meadjiunlem.g	. . . . . 6 ⊢ (𝜑 → 𝐺:𝑋⟶𝑆)
3		meadjiunlem.x	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
4	2, 3	jca 511	. . . . 5 ⊢ (𝜑 → (𝐺:𝑋⟶𝑆 ∧ 𝑋 ∈ 𝑉))
5		fex 7084	. . . . 5 ⊢ ((𝐺:𝑋⟶𝑆 ∧ 𝑋 ∈ 𝑉) → 𝐺 ∈ V)
6		rnexg 7725	. . . . 5 ⊢ (𝐺 ∈ V → ran 𝐺 ∈ V)
7	4, 5, 6	3syl 18	. . . 4 ⊢ (𝜑 → ran 𝐺 ∈ V)
8		difssd 4063	. . . 4 ⊢ (𝜑 → (ran 𝐺 ∖ {∅}) ⊆ ran 𝐺)
9		meadjiunlem.f	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ Meas)
10		meadjiunlem.3	. . . . . . 7 ⊢ 𝑆 = dom 𝑀
11	9, 10	meaf 43881	. . . . . 6 ⊢ (𝜑 → 𝑀:𝑆⟶(0[,]+∞))
12	11	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ {∅})) → 𝑀:𝑆⟶(0[,]+∞))
13	2	frnd 6592	. . . . . . 7 ⊢ (𝜑 → ran 𝐺 ⊆ 𝑆)
14	13	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ {∅})) → ran 𝐺 ⊆ 𝑆)
15	8	sselda 3917	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ {∅})) → 𝑘 ∈ ran 𝐺)
16	14, 15	sseldd 3918	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ {∅})) → 𝑘 ∈ 𝑆)
17	12, 16	ffvelrnd 6944	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ {∅})) → (𝑀‘𝑘) ∈ (0[,]+∞))
18		simpl 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅}))) → 𝜑)
19		id 22	. . . . . . . 8 ⊢ (𝑘 ∈ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅})) → 𝑘 ∈ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅})))
20		dfin4 4198	. . . . . . . . 9 ⊢ (ran 𝐺 ∩ {∅}) = (ran 𝐺 ∖ (ran 𝐺 ∖ {∅}))
21	20	eqcomi 2747	. . . . . . . 8 ⊢ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅})) = (ran 𝐺 ∩ {∅})
22	19, 21	eleqtrdi 2849	. . . . . . 7 ⊢ (𝑘 ∈ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅})) → 𝑘 ∈ (ran 𝐺 ∩ {∅}))
23		elinel2 4126	. . . . . . . 8 ⊢ (𝑘 ∈ (ran 𝐺 ∩ {∅}) → 𝑘 ∈ {∅})
24		elsni 4575	. . . . . . . 8 ⊢ (𝑘 ∈ {∅} → 𝑘 = ∅)
25	23, 24	syl 17	. . . . . . 7 ⊢ (𝑘 ∈ (ran 𝐺 ∩ {∅}) → 𝑘 = ∅)
26	22, 25	syl 17	. . . . . 6 ⊢ (𝑘 ∈ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅})) → 𝑘 = ∅)
27	26	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅}))) → 𝑘 = ∅)
28		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 = ∅) → 𝑘 = ∅)
29	28	fveq2d 6760	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = ∅) → (𝑀‘𝑘) = (𝑀‘∅))
30	9	mea0 43882	. . . . . . 7 ⊢ (𝜑 → (𝑀‘∅) = 0)
31	30	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 = ∅) → (𝑀‘∅) = 0)
32	29, 31	eqtrd 2778	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 = ∅) → (𝑀‘𝑘) = 0)
33	18, 27, 32	syl2anc 583	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (ran 𝐺 ∖ (ran 𝐺 ∖ {∅}))) → (𝑀‘𝑘) = 0)
34	1, 7, 8, 17, 33	sge0ss 43840	. . 3 ⊢ (𝜑 → (Σ^{^}‘(𝑘 ∈ (ran 𝐺 ∖ {∅}) ↦ (𝑀‘𝑘))) = (Σ^{^}‘(𝑘 ∈ ran 𝐺 ↦ (𝑀‘𝑘))))
35	34	eqcomd 2744	. 2 ⊢ (𝜑 → (Σ^{^}‘(𝑘 ∈ ran 𝐺 ↦ (𝑀‘𝑘))) = (Σ^{^}‘(𝑘 ∈ (ran 𝐺 ∖ {∅}) ↦ (𝑀‘𝑘))))
36	11, 13	feqresmpt 6820	. . 3 ⊢ (𝜑 → (𝑀 ↾ ran 𝐺) = (𝑘 ∈ ran 𝐺 ↦ (𝑀‘𝑘)))
37	36	fveq2d 6760	. 2 ⊢ (𝜑 → (Σ^{^}‘(𝑀 ↾ ran 𝐺)) = (Σ^{^}‘(𝑘 ∈ ran 𝐺 ↦ (𝑀‘𝑘))))
38	2	ffvelrnda 6943	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑋) → (𝐺‘𝑗) ∈ 𝑆)
39	2	feqmptd 6819	. . . . 5 ⊢ (𝜑 → 𝐺 = (𝑗 ∈ 𝑋 ↦ (𝐺‘𝑗)))
40	11	feqmptd 6819	. . . . 5 ⊢ (𝜑 → 𝑀 = (𝑘 ∈ 𝑆 ↦ (𝑀‘𝑘)))
41		fveq2 6756	. . . . 5 ⊢ (𝑘 = (𝐺‘𝑗) → (𝑀‘𝑘) = (𝑀‘(𝐺‘𝑗)))
42	38, 39, 40, 41	fmptco 6983	. . . 4 ⊢ (𝜑 → (𝑀 ∘ 𝐺) = (𝑗 ∈ 𝑋 ↦ (𝑀‘(𝐺‘𝑗))))
43	42	fveq2d 6760	. . 3 ⊢ (𝜑 → (Σ^{^}‘(𝑀 ∘ 𝐺)) = (Σ^{^}‘(𝑗 ∈ 𝑋 ↦ (𝑀‘(𝐺‘𝑗)))))
44		nfv 1918	. . . . 5 ⊢ Ⅎ𝑗𝜑
45		meadjiunlem.y	. . . . . 6 ⊢ 𝑌 = {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅}
46		ssrab2 4009	. . . . . . 7 ⊢ {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅} ⊆ 𝑋
47	46	a1i 11	. . . . . 6 ⊢ (𝜑 → {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅} ⊆ 𝑋)
48	45, 47	eqsstrid 3965	. . . . 5 ⊢ (𝜑 → 𝑌 ⊆ 𝑋)
49	11	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑌) → 𝑀:𝑆⟶(0[,]+∞))
50	2	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑌) → 𝐺:𝑋⟶𝑆)
51	48	sselda 3917	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑌) → 𝑗 ∈ 𝑋)
52	50, 51	ffvelrnd 6944	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑌) → (𝐺‘𝑗) ∈ 𝑆)
53	49, 52	ffvelrnd 6944	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑌) → (𝑀‘(𝐺‘𝑗)) ∈ (0[,]+∞))
54		eldifi 4057	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (𝑋 ∖ 𝑌) → 𝑗 ∈ 𝑋)
55	54	ad2antlr 723	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) → 𝑗 ∈ 𝑋)
56		fveq2 6756	. . . . . . . . . . . . . . 15 ⊢ ((𝐺‘𝑗) = ∅ → (𝑀‘(𝐺‘𝑗)) = (𝑀‘∅))
57	56	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐺‘𝑗) = ∅) → (𝑀‘(𝐺‘𝑗)) = (𝑀‘∅))
58	9	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝐺‘𝑗) = ∅) → 𝑀 ∈ Meas)
59	58	mea0 43882	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝐺‘𝑗) = ∅) → (𝑀‘∅) = 0)
60	57, 59	eqtrd 2778	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝐺‘𝑗) = ∅) → (𝑀‘(𝐺‘𝑗)) = 0)
61	60	ad4ant14 748	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) ∧ (𝐺‘𝑗) = ∅) → (𝑀‘(𝐺‘𝑗)) = 0)
62		neneq 2948	. . . . . . . . . . . . 13 ⊢ ((𝑀‘(𝐺‘𝑗)) ≠ 0 → ¬ (𝑀‘(𝐺‘𝑗)) = 0)
63	62	ad2antlr 723	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) ∧ (𝐺‘𝑗) = ∅) → ¬ (𝑀‘(𝐺‘𝑗)) = 0)
64	61, 63	pm2.65da 813	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) → ¬ (𝐺‘𝑗) = ∅)
65	64	neqned 2949	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) → (𝐺‘𝑗) ≠ ∅)
66	55, 65	jca 511	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) → (𝑗 ∈ 𝑋 ∧ (𝐺‘𝑗) ≠ ∅))
67		fveq2 6756	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑗 → (𝐺‘𝑖) = (𝐺‘𝑗))
68	67	neeq1d 3002	. . . . . . . . . 10 ⊢ (𝑖 = 𝑗 → ((𝐺‘𝑖) ≠ ∅ ↔ (𝐺‘𝑗) ≠ ∅))
69	68	elrab 3617	. . . . . . . . 9 ⊢ (𝑗 ∈ {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅} ↔ (𝑗 ∈ 𝑋 ∧ (𝐺‘𝑗) ≠ ∅))
70	66, 69	sylibr 233	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) → 𝑗 ∈ {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅})
71	70, 45	eleqtrrdi 2850	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) → 𝑗 ∈ 𝑌)
72		eldifn 4058	. . . . . . . 8 ⊢ (𝑗 ∈ (𝑋 ∖ 𝑌) → ¬ 𝑗 ∈ 𝑌)
73	72	ad2antlr 723	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) ∧ (𝑀‘(𝐺‘𝑗)) ≠ 0) → ¬ 𝑗 ∈ 𝑌)
74	71, 73	pm2.65da 813	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) → ¬ (𝑀‘(𝐺‘𝑗)) ≠ 0)
75		nne 2946	. . . . . 6 ⊢ (¬ (𝑀‘(𝐺‘𝑗)) ≠ 0 ↔ (𝑀‘(𝐺‘𝑗)) = 0)
76	74, 75	sylib 217	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ (𝑋 ∖ 𝑌)) → (𝑀‘(𝐺‘𝑗)) = 0)
77	44, 3, 48, 53, 76	sge0ss 43840	. . . 4 ⊢ (𝜑 → (Σ^{^}‘(𝑗 ∈ 𝑌 ↦ (𝑀‘(𝐺‘𝑗)))) = (Σ^{^}‘(𝑗 ∈ 𝑋 ↦ (𝑀‘(𝐺‘𝑗)))))
78	77	eqcomd 2744	. . 3 ⊢ (𝜑 → (Σ^{^}‘(𝑗 ∈ 𝑋 ↦ (𝑀‘(𝐺‘𝑗)))) = (Σ^{^}‘(𝑗 ∈ 𝑌 ↦ (𝑀‘(𝐺‘𝑗)))))
79	3, 48	ssexd 5243	. . . . 5 ⊢ (𝜑 → 𝑌 ∈ V)
80		nfv 1918	. . . . . . . . 9 ⊢ Ⅎ𝑖𝜑
81		eqid 2738	. . . . . . . . 9 ⊢ (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)) = (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖))
82	2	ffnd 6585	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐺 Fn 𝑋)
83		dffn3 6597	. . . . . . . . . . . . 13 ⊢ (𝐺 Fn 𝑋 ↔ 𝐺:𝑋⟶ran 𝐺)
84	82, 83	sylib 217	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐺:𝑋⟶ran 𝐺)
85	84	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑌) → 𝐺:𝑋⟶ran 𝐺)
86	48	sselda 3917	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑌) → 𝑖 ∈ 𝑋)
87	85, 86	ffvelrnd 6944	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑌) → (𝐺‘𝑖) ∈ ran 𝐺)
88	45	eleq2i 2830	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ 𝑌 ↔ 𝑖 ∈ {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅})
89		rabid 3304	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ {𝑖 ∈ 𝑋 ∣ (𝐺‘𝑖) ≠ ∅} ↔ (𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅))
90	88, 89	bitri 274	. . . . . . . . . . . . . 14 ⊢ (𝑖 ∈ 𝑌 ↔ (𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅))
91	90	biimpi 215	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ 𝑌 → (𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅))
92	91	simprd 495	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ 𝑌 → (𝐺‘𝑖) ≠ ∅)
93	92	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑌) → (𝐺‘𝑖) ≠ ∅)
94		nelsn 4598	. . . . . . . . . . 11 ⊢ ((𝐺‘𝑖) ≠ ∅ → ¬ (𝐺‘𝑖) ∈ {∅})
95	93, 94	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑌) → ¬ (𝐺‘𝑖) ∈ {∅})
96	87, 95	eldifd 3894	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑌) → (𝐺‘𝑖) ∈ (ran 𝐺 ∖ {∅}))
97		meadjiunlem.dj	. . . . . . . . . 10 ⊢ (𝜑 → Disj 𝑖 ∈ 𝑋 (𝐺‘𝑖))
98		disjss1 5041	. . . . . . . . . 10 ⊢ (𝑌 ⊆ 𝑋 → (Disj 𝑖 ∈ 𝑋 (𝐺‘𝑖) → Disj 𝑖 ∈ 𝑌 (𝐺‘𝑖)))
99	48, 97, 98	sylc 65	. . . . . . . . 9 ⊢ (𝜑 → Disj 𝑖 ∈ 𝑌 (𝐺‘𝑖))
100	80, 81, 96, 93, 99	disjf1 42609	. . . . . . . 8 ⊢ (𝜑 → (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)):𝑌–1-1→(ran 𝐺 ∖ {∅}))
101	2, 48	feqresmpt 6820	. . . . . . . . 9 ⊢ (𝜑 → (𝐺 ↾ 𝑌) = (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)))
102		f1eq1 6649	. . . . . . . . 9 ⊢ ((𝐺 ↾ 𝑌) = (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)) → ((𝐺 ↾ 𝑌):𝑌–1-1→(ran 𝐺 ∖ {∅}) ↔ (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)):𝑌–1-1→(ran 𝐺 ∖ {∅})))
103	101, 102	syl 17	. . . . . . . 8 ⊢ (𝜑 → ((𝐺 ↾ 𝑌):𝑌–1-1→(ran 𝐺 ∖ {∅}) ↔ (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)):𝑌–1-1→(ran 𝐺 ∖ {∅})))
104	100, 103	mpbird 256	. . . . . . 7 ⊢ (𝜑 → (𝐺 ↾ 𝑌):𝑌–1-1→(ran 𝐺 ∖ {∅}))
105	101	rneqd 5836	. . . . . . . . 9 ⊢ (𝜑 → ran (𝐺 ↾ 𝑌) = ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)))
106	96	ralrimiva 3107	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑖 ∈ 𝑌 (𝐺‘𝑖) ∈ (ran 𝐺 ∖ {∅}))
107	81	rnmptss 6978	. . . . . . . . . 10 ⊢ (∀𝑖 ∈ 𝑌 (𝐺‘𝑖) ∈ (ran 𝐺 ∖ {∅}) → ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)) ⊆ (ran 𝐺 ∖ {∅}))
108	106, 107	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)) ⊆ (ran 𝐺 ∖ {∅}))
109	105, 108	eqsstrd 3955	. . . . . . . 8 ⊢ (𝜑 → ran (𝐺 ↾ 𝑌) ⊆ (ran 𝐺 ∖ {∅}))
110		simpl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (ran 𝐺 ∖ {∅})) → 𝜑)
111		eldifi 4057	. . . . . . . . . 10 ⊢ (𝑥 ∈ (ran 𝐺 ∖ {∅}) → 𝑥 ∈ ran 𝐺)
112	111	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (ran 𝐺 ∖ {∅})) → 𝑥 ∈ ran 𝐺)
113		eldifsni 4720	. . . . . . . . . 10 ⊢ (𝑥 ∈ (ran 𝐺 ∖ {∅}) → 𝑥 ≠ ∅)
114	113	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (ran 𝐺 ∖ {∅})) → 𝑥 ≠ ∅)
115		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐺) → 𝑥 ∈ ran 𝐺)
116		fvelrnb 6812	. . . . . . . . . . . . . 14 ⊢ (𝐺 Fn 𝑋 → (𝑥 ∈ ran 𝐺 ↔ ∃𝑖 ∈ 𝑋 (𝐺‘𝑖) = 𝑥))
117	82, 116	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑥 ∈ ran 𝐺 ↔ ∃𝑖 ∈ 𝑋 (𝐺‘𝑖) = 𝑥))
118	117	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐺) → (𝑥 ∈ ran 𝐺 ↔ ∃𝑖 ∈ 𝑋 (𝐺‘𝑖) = 𝑥))
119	115, 118	mpbid 231	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐺) → ∃𝑖 ∈ 𝑋 (𝐺‘𝑖) = 𝑥)
120	119	3adant3 1130	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐺 ∧ 𝑥 ≠ ∅) → ∃𝑖 ∈ 𝑋 (𝐺‘𝑖) = 𝑥)
121		id 22	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺‘𝑖) = 𝑥 → (𝐺‘𝑖) = 𝑥)
122	121	eqcomd 2744	. . . . . . . . . . . . . . 15 ⊢ ((𝐺‘𝑖) = 𝑥 → 𝑥 = (𝐺‘𝑖))
123	122	3ad2ant3 1133	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ≠ ∅) ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) = 𝑥) → 𝑥 = (𝐺‘𝑖))
124		simp1l 1195	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ≠ ∅) ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) = 𝑥) → 𝜑)
125		simp2 1135	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ≠ ∅) ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) = 𝑥) → 𝑖 ∈ 𝑋)
126		simpr 484	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ≠ ∅ ∧ (𝐺‘𝑖) = 𝑥) → (𝐺‘𝑖) = 𝑥)
127		simpl 482	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑥 ≠ ∅ ∧ (𝐺‘𝑖) = 𝑥) → 𝑥 ≠ ∅)
128	126, 127	eqnetrd 3010	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 ≠ ∅ ∧ (𝐺‘𝑖) = 𝑥) → (𝐺‘𝑖) ≠ ∅)
129	128	adantll 710	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ≠ ∅) ∧ (𝐺‘𝑖) = 𝑥) → (𝐺‘𝑖) ≠ ∅)
130	129	3adant2 1129	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ≠ ∅) ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) = 𝑥) → (𝐺‘𝑖) ≠ ∅)
131	90	biimpri 227	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅) → 𝑖 ∈ 𝑌)
132		fvexd 6771	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅) → (𝐺‘𝑖) ∈ V)
133	81	elrnmpt1 5856	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑖 ∈ 𝑌 ∧ (𝐺‘𝑖) ∈ V) → (𝐺‘𝑖) ∈ ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)))
134	131, 132, 133	syl2anc 583	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅) → (𝐺‘𝑖) ∈ ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)))
135	134	3adant1 1128	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅) → (𝐺‘𝑖) ∈ ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)))
136	105	eqcomd 2744	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)) = ran (𝐺 ↾ 𝑌))
137	136	3ad2ant1 1131	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅) → ran (𝑖 ∈ 𝑌 ↦ (𝐺‘𝑖)) = ran (𝐺 ↾ 𝑌))
138	135, 137	eleqtrd 2841	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) ≠ ∅) → (𝐺‘𝑖) ∈ ran (𝐺 ↾ 𝑌))
139	124, 125, 130, 138	syl3anc 1369	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ≠ ∅) ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) = 𝑥) → (𝐺‘𝑖) ∈ ran (𝐺 ↾ 𝑌))
140	123, 139	eqeltrd 2839	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ≠ ∅) ∧ 𝑖 ∈ 𝑋 ∧ (𝐺‘𝑖) = 𝑥) → 𝑥 ∈ ran (𝐺 ↾ 𝑌))
141	140	3exp 1117	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ≠ ∅) → (𝑖 ∈ 𝑋 → ((𝐺‘𝑖) = 𝑥 → 𝑥 ∈ ran (𝐺 ↾ 𝑌))))
142	141	rexlimdv 3211	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑥 ≠ ∅) → (∃𝑖 ∈ 𝑋 (𝐺‘𝑖) = 𝑥 → 𝑥 ∈ ran (𝐺 ↾ 𝑌)))
143	142	3adant2 1129	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐺 ∧ 𝑥 ≠ ∅) → (∃𝑖 ∈ 𝑋 (𝐺‘𝑖) = 𝑥 → 𝑥 ∈ ran (𝐺 ↾ 𝑌)))
144	120, 143	mpd 15	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ran 𝐺 ∧ 𝑥 ≠ ∅) → 𝑥 ∈ ran (𝐺 ↾ 𝑌))
145	110, 112, 114, 144	syl3anc 1369	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (ran 𝐺 ∖ {∅})) → 𝑥 ∈ ran (𝐺 ↾ 𝑌))
146	109, 145	eqelssd 3938	. . . . . . 7 ⊢ (𝜑 → ran (𝐺 ↾ 𝑌) = (ran 𝐺 ∖ {∅}))
147	104, 146	jca 511	. . . . . 6 ⊢ (𝜑 → ((𝐺 ↾ 𝑌):𝑌–1-1→(ran 𝐺 ∖ {∅}) ∧ ran (𝐺 ↾ 𝑌) = (ran 𝐺 ∖ {∅})))
148		dff1o5 6709	. . . . . 6 ⊢ ((𝐺 ↾ 𝑌):𝑌–1-1-onto→(ran 𝐺 ∖ {∅}) ↔ ((𝐺 ↾ 𝑌):𝑌–1-1→(ran 𝐺 ∖ {∅}) ∧ ran (𝐺 ↾ 𝑌) = (ran 𝐺 ∖ {∅})))
149	147, 148	sylibr 233	. . . . 5 ⊢ (𝜑 → (𝐺 ↾ 𝑌):𝑌–1-1-onto→(ran 𝐺 ∖ {∅}))
150		fvres 6775	. . . . . 6 ⊢ (𝑗 ∈ 𝑌 → ((𝐺 ↾ 𝑌)‘𝑗) = (𝐺‘𝑗))
151	150	adantl 481	. . . . 5 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑌) → ((𝐺 ↾ 𝑌)‘𝑗) = (𝐺‘𝑗))
152	1, 44, 41, 79, 149, 151, 17	sge0f1o 43810	. . . 4 ⊢ (𝜑 → (Σ^{^}‘(𝑘 ∈ (ran 𝐺 ∖ {∅}) ↦ (𝑀‘𝑘))) = (Σ^{^}‘(𝑗 ∈ 𝑌 ↦ (𝑀‘(𝐺‘𝑗)))))
153	152	eqcomd 2744	. . 3 ⊢ (𝜑 → (Σ^{^}‘(𝑗 ∈ 𝑌 ↦ (𝑀‘(𝐺‘𝑗)))) = (Σ^{^}‘(𝑘 ∈ (ran 𝐺 ∖ {∅}) ↦ (𝑀‘𝑘))))
154	43, 78, 153	3eqtrd 2782	. 2 ⊢ (𝜑 → (Σ^{^}‘(𝑀 ∘ 𝐺)) = (Σ^{^}‘(𝑘 ∈ (ran 𝐺 ∖ {∅}) ↦ (𝑀‘𝑘))))
155	35, 37, 154	3eqtr4d 2788	1 ⊢ (𝜑 → (Σ^{^}‘(𝑀 ↾ ran 𝐺)) = (Σ^{^}‘(𝑀 ∘ 𝐺)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 ∀wral 3063 ∃wrex 3064 {crab 3067 Vcvv 3422 ∖ cdif 3880 ∩ cin 3882 ⊆ wss 3883 ∅c0 4253 {csn 4558 Disj wdisj 5035 ↦ cmpt 5153 dom cdm 5580 ran crn 5581 ↾ cres 5582 ∘ ccom 5584 Fn wfn 6413 ⟶wf 6414 –1-1→wf1 6415 –1-1-onto→wf1o 6417 ‘cfv 6418 (class class class)co 7255 0cc0 10802 +∞cpnf 10937 [,]cicc 13011 Σ^{^}csumge0 43790 Meascmea 43877

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-inf2 9329 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-disj 5036 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-se 5536 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-isom 6427 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-sup 9131 df-oi 9199 df-card 9628 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-n0 12164 df-z 12250 df-uz 12512 df-rp 12660 df-xadd 12778 df-ico 13014 df-icc 13015 df-fz 13169 df-fzo 13312 df-seq 13650 df-exp 13711 df-hash 13973 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-clim 15125 df-sum 15326 df-sumge0 43791 df-mea 43878

This theorem is referenced by: meadjiun 43894

W3C validator