tsmssubm - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > tsmssubm		Structured version Visualization version GIF version

Theorem tsmssubm 23654

Description: Evaluate an infinite group sum in a submonoid. (Contributed by Mario Carneiro, 18-Sep-2015.)

**Hypotheses**
Ref	Expression
tsmssubm.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
tsmssubm.1	⊢ (𝜑 → 𝐺 ∈ CMnd)
tsmssubm.2	⊢ (𝜑 → 𝐺 ∈ TopSp)
tsmssubm.s	⊢ (𝜑 → 𝑆 ∈ (SubMnd‘𝐺))
tsmssubm.f	⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
tsmssubm.h	⊢ 𝐻 = (𝐺 ↾_s 𝑆)

**Assertion**
Ref	Expression
tsmssubm	⊢ (𝜑 → (𝐻 tsums 𝐹) = ((𝐺 tsums 𝐹) ∩ 𝑆))

Proof of Theorem tsmssubm Dummy variables 𝑣 𝑢 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		tsmssubm.s	. . . . . 6 ⊢ (𝜑 → 𝑆 ∈ (SubMnd‘𝐺))
2		tsmssubm.h	. . . . . . 7 ⊢ 𝐻 = (𝐺 ↾_s 𝑆)
3	2	submbas 18697	. . . . . 6 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 = (Base‘𝐻))
4	1, 3	syl 17	. . . . 5 ⊢ (𝜑 → 𝑆 = (Base‘𝐻))
5	4	eleq2d 2819	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑆 ↔ 𝑥 ∈ (Base‘𝐻)))
6	5	anbi1d 630	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣))) ↔ (𝑥 ∈ (Base‘𝐻) ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
7		elin 3964	. . . . 5 ⊢ (𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆) ↔ (𝑥 ∈ (𝐺 tsums 𝐹) ∧ 𝑥 ∈ 𝑆))
8	7	biancomi 463	. . . 4 ⊢ (𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆) ↔ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)))
9		eqid 2732	. . . . . . . . . 10 ⊢ (Base‘𝐺) = (Base‘𝐺)
10	9	submss 18692	. . . . . . . . 9 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
11	1, 10	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐺))
12	11	sselda 3982	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
13		eqid 2732	. . . . . . . . 9 ⊢ (TopOpen‘𝐺) = (TopOpen‘𝐺)
14		eqid 2732	. . . . . . . . 9 ⊢ (𝒫 𝐴 ∩ Fin) = (𝒫 𝐴 ∩ Fin)
15		tsmssubm.1	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ CMnd)
16		tsmssubm.2	. . . . . . . . 9 ⊢ (𝜑 → 𝐺 ∈ TopSp)
17		tsmssubm.a	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
18		tsmssubm.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆)
19	18, 11	fssd 6735	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝐴⟶(Base‘𝐺))
20	9, 13, 14, 15, 16, 17, 19	eltsms 23644	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ (𝑥 ∈ (Base‘𝐺) ∧ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))))
21	20	baibd 540	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
22	12, 21	syldan 591	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
23		vex 3478	. . . . . . . . 9 ⊢ 𝑢 ∈ V
24	23	inex1 5317	. . . . . . . 8 ⊢ (𝑢 ∩ 𝑆) ∈ V
25	24	a1i 11	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑢 ∈ (TopOpen‘𝐺)) → (𝑢 ∩ 𝑆) ∈ V)
26	2, 13	resstopn 22697	. . . . . . . . 9 ⊢ ((TopOpen‘𝐺) ↾_t 𝑆) = (TopOpen‘𝐻)
27	26	eleq2i 2825	. . . . . . . 8 ⊢ (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ 𝑣 ∈ (TopOpen‘𝐻))
28		fvex 6904	. . . . . . . . . 10 ⊢ (TopOpen‘𝐺) ∈ V
29		elrest 17375	. . . . . . . . . 10 ⊢ (((TopOpen‘𝐺) ∈ V ∧ 𝑆 ∈ (SubMnd‘𝐺)) → (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
30	28, 1, 29	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
31	30	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
32	27, 31	bitr3id 284	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑣 ∈ (TopOpen‘𝐻) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
33		eleq2 2822	. . . . . . . . 9 ⊢ (𝑣 = (𝑢 ∩ 𝑆) → (𝑥 ∈ 𝑣 ↔ 𝑥 ∈ (𝑢 ∩ 𝑆)))
34		elin 3964	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝑢 ∩ 𝑆) ↔ (𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝑆))
35	34	rbaib 539	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝑆 → (𝑥 ∈ (𝑢 ∩ 𝑆) ↔ 𝑥 ∈ 𝑢))
36	35	adantl 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝑢 ∩ 𝑆) ↔ 𝑥 ∈ 𝑢))
37	33, 36	sylan9bbr 511	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → (𝑥 ∈ 𝑣 ↔ 𝑥 ∈ 𝑢))
38		eleq2 2822	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑢 ∩ 𝑆) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣 ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆)))
39		eqid 2732	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘𝐻) = (Base‘𝐻)
40		eqid 2732	. . . . . . . . . . . . . . . . 17 ⊢ (0_g‘𝐻) = (0_g‘𝐻)
41	2	submmnd 18696	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝐻 ∈ Mnd)
42	1, 41	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐻 ∈ Mnd)
43	2	subcmn 19707	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ CMnd ∧ 𝐻 ∈ Mnd) → 𝐻 ∈ CMnd)
44	15, 42, 43	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐻 ∈ CMnd)
45	44	ad2antrr 724	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝐻 ∈ CMnd)
46		elinel2 4196	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ (𝒫 𝐴 ∩ Fin) → 𝑦 ∈ Fin)
47	46	adantl 482	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑦 ∈ Fin)
48	18	ad2antrr 724	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝐹:𝐴⟶𝑆)
49		elfpw 9356	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑦 ⊆ 𝐴 ∧ 𝑦 ∈ Fin))
50	49	simplbi 498	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ (𝒫 𝐴 ∩ Fin) → 𝑦 ⊆ 𝐴)
51	50	adantl 482	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑦 ⊆ 𝐴)
52	48, 51	fssresd 6758	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐹 ↾ 𝑦):𝑦⟶𝑆)
53	4	ad2antrr 724	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑆 = (Base‘𝐻))
54	53	feq3d 6704	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐹 ↾ 𝑦):𝑦⟶𝑆 ↔ (𝐹 ↾ 𝑦):𝑦⟶(Base‘𝐻)))
55	52, 54	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐹 ↾ 𝑦):𝑦⟶(Base‘𝐻))
56		fvex 6904	. . . . . . . . . . . . . . . . . . 19 ⊢ (0_g‘𝐻) ∈ V
57	56	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (0_g‘𝐻) ∈ V)
58	52, 47, 57	fdmfifsupp 9375	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐹 ↾ 𝑦) finSupp (0_g‘𝐻))
59	39, 40, 45, 47, 55, 58	gsumcl 19785	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (Base‘𝐻))
60	59, 53	eleqtrrd 2836	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑆)
61		elin 3964	. . . . . . . . . . . . . . . 16 ⊢ ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢 ∧ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑆))
62	61	rbaib 539	. . . . . . . . . . . . . . 15 ⊢ ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑆 → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
63	60, 62	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
64	1	ad2antrr 724	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑆 ∈ (SubMnd‘𝐺))
65	47, 64, 52, 2	gsumsubm 18718	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐺 Σ_g (𝐹 ↾ 𝑦)) = (𝐻 Σ_g (𝐹 ↾ 𝑦)))
66	65	eleq1d 2818	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢 ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
67	63, 66	bitr4d 281	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
68	38, 67	sylan9bbr 511	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣 ↔ (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
69	68	an32s 650	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣 ↔ (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
70	69	imbi2d 340	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣) ↔ (𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))
71	70	ralbidva 3175	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → (∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣) ↔ ∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))
72	71	rexbidv 3178	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → (∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣) ↔ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))
73	37, 72	imbi12d 344	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → ((𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)) ↔ (𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
74	25, 32, 73	ralxfr2d 5408	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)) ↔ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
75	22, 74	bitr4d 281	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣))))
76	75	pm5.32da 579	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ↔ (𝑥 ∈ 𝑆 ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
77	8, 76	bitrid 282	. . 3 ⊢ (𝜑 → (𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆) ↔ (𝑥 ∈ 𝑆 ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
78		eqid 2732	. . . 4 ⊢ (TopOpen‘𝐻) = (TopOpen‘𝐻)
79		resstps 22698	. . . . . 6 ⊢ ((𝐺 ∈ TopSp ∧ 𝑆 ∈ (SubMnd‘𝐺)) → (𝐺 ↾_s 𝑆) ∈ TopSp)
80	16, 1, 79	syl2anc 584	. . . . 5 ⊢ (𝜑 → (𝐺 ↾_s 𝑆) ∈ TopSp)
81	2, 80	eqeltrid 2837	. . . 4 ⊢ (𝜑 → 𝐻 ∈ TopSp)
82	4	feq3d 6704	. . . . 5 ⊢ (𝜑 → (𝐹:𝐴⟶𝑆 ↔ 𝐹:𝐴⟶(Base‘𝐻)))
83	18, 82	mpbid 231	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶(Base‘𝐻))
84	39, 78, 14, 44, 81, 17, 83	eltsms 23644	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐻 tsums 𝐹) ↔ (𝑥 ∈ (Base‘𝐻) ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
85	6, 77, 84	3bitr4rd 311	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐻 tsums 𝐹) ↔ 𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆)))
86	85	eqrdv 2730	1 ⊢ (𝜑 → (𝐻 tsums 𝐹) = ((𝐺 tsums 𝐹) ∩ 𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 Vcvv 3474 ∩ cin 3947 ⊆ wss 3948 𝒫 cpw 4602 ↾ cres 5678 ⟶wf 6539 ‘cfv 6543 (class class class)co 7411 Fincfn 8941 Basecbs 17146 ↾_s cress 17175 ↾_t crest 17368 TopOpenctopn 17369 0_gc0g 17387 Σ_g cgsu 17388 Mndcmnd 18627 SubMndcsubmnd 18672 CMndccmn 19650 TopSpctps 22441 tsums ctsu 23637

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-supp 8149 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9364 df-fi 9408 df-oi 9507 df-card 9936 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-nn 12215 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-7 12282 df-8 12283 df-9 12284 df-n0 12475 df-z 12561 df-uz 12825 df-fz 13487 df-fzo 13630 df-seq 13969 df-hash 14293 df-sets 17099 df-slot 17117 df-ndx 17129 df-base 17147 df-ress 17176 df-plusg 17212 df-tset 17218 df-rest 17370 df-topn 17371 df-0g 17389 df-gsum 17390 df-topgen 17391 df-mgm 18563 df-sgrp 18612 df-mnd 18628 df-submnd 18674 df-cntz 19183 df-cmn 19652 df-fbas 20947 df-fg 20948 df-top 22403 df-topon 22420 df-topsp 22442 df-bases 22456 df-ntr 22531 df-nei 22609 df-fil 23357 df-fm 23449 df-flim 23450 df-flf 23451 df-tsms 23638

This theorem is referenced by: (None)

W3C validator