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 23647

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 18695	. . . . . 6 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 = (Base‘𝐻))
4	1, 3	syl 17	. . . . 5 ⊢ (𝜑 → 𝑆 = (Base‘𝐻))
5	4	eleq2d 2820	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝑆 ↔ 𝑥 ∈ (Base‘𝐻)))
6	5	anbi1d 631	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣))) ↔ (𝑥 ∈ (Base‘𝐻) ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
7		elin 3965	. . . . 5 ⊢ (𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆) ↔ (𝑥 ∈ (𝐺 tsums 𝐹) ∧ 𝑥 ∈ 𝑆))
8	7	biancomi 464	. . . 4 ⊢ (𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆) ↔ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)))
9		eqid 2733	. . . . . . . . . 10 ⊢ (Base‘𝐺) = (Base‘𝐺)
10	9	submss 18690	. . . . . . . . 9 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 ⊆ (Base‘𝐺))
11	1, 10	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑆 ⊆ (Base‘𝐺))
12	11	sselda 3983	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝐺))
13		eqid 2733	. . . . . . . . 9 ⊢ (TopOpen‘𝐺) = (TopOpen‘𝐺)
14		eqid 2733	. . . . . . . . 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 6736	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝐴⟶(Base‘𝐺))
20	9, 13, 14, 15, 16, 17, 19	eltsms 23637	. . . . . . . 8 ⊢ (𝜑 → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ (𝑥 ∈ (Base‘𝐺) ∧ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))))
21	20	baibd 541	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (Base‘𝐺)) → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
22	12, 21	syldan 592	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
23		vex 3479	. . . . . . . . 9 ⊢ 𝑢 ∈ V
24	23	inex1 5318	. . . . . . . 8 ⊢ (𝑢 ∩ 𝑆) ∈ V
25	24	a1i 11	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑢 ∈ (TopOpen‘𝐺)) → (𝑢 ∩ 𝑆) ∈ V)
26	2, 13	resstopn 22690	. . . . . . . . 9 ⊢ ((TopOpen‘𝐺) ↾_t 𝑆) = (TopOpen‘𝐻)
27	26	eleq2i 2826	. . . . . . . 8 ⊢ (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ 𝑣 ∈ (TopOpen‘𝐻))
28		fvex 6905	. . . . . . . . . 10 ⊢ (TopOpen‘𝐺) ∈ V
29		elrest 17373	. . . . . . . . . 10 ⊢ (((TopOpen‘𝐺) ∈ V ∧ 𝑆 ∈ (SubMnd‘𝐺)) → (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
30	28, 1, 29	sylancr 588	. . . . . . . . 9 ⊢ (𝜑 → (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
31	30	adantr 482	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑣 ∈ ((TopOpen‘𝐺) ↾_t 𝑆) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
32	27, 31	bitr3id 285	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑣 ∈ (TopOpen‘𝐻) ↔ ∃𝑢 ∈ (TopOpen‘𝐺)𝑣 = (𝑢 ∩ 𝑆)))
33		eleq2 2823	. . . . . . . . 9 ⊢ (𝑣 = (𝑢 ∩ 𝑆) → (𝑥 ∈ 𝑣 ↔ 𝑥 ∈ (𝑢 ∩ 𝑆)))
34		elin 3965	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝑢 ∩ 𝑆) ↔ (𝑥 ∈ 𝑢 ∧ 𝑥 ∈ 𝑆))
35	34	rbaib 540	. . . . . . . . . 10 ⊢ (𝑥 ∈ 𝑆 → (𝑥 ∈ (𝑢 ∩ 𝑆) ↔ 𝑥 ∈ 𝑢))
36	35	adantl 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝑢 ∩ 𝑆) ↔ 𝑥 ∈ 𝑢))
37	33, 36	sylan9bbr 512	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → (𝑥 ∈ 𝑣 ↔ 𝑥 ∈ 𝑢))
38		eleq2 2823	. . . . . . . . . . . . 13 ⊢ (𝑣 = (𝑢 ∩ 𝑆) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣 ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆)))
39		eqid 2733	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘𝐻) = (Base‘𝐻)
40		eqid 2733	. . . . . . . . . . . . . . . . 17 ⊢ (0_g‘𝐻) = (0_g‘𝐻)
41	2	submmnd 18694	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝐻 ∈ Mnd)
42	1, 41	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝜑 → 𝐻 ∈ Mnd)
43	2	subcmn 19705	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ CMnd ∧ 𝐻 ∈ Mnd) → 𝐻 ∈ CMnd)
44	15, 42, 43	syl2anc 585	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐻 ∈ CMnd)
45	44	ad2antrr 725	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝐻 ∈ CMnd)
46		elinel2 4197	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ (𝒫 𝐴 ∩ Fin) → 𝑦 ∈ Fin)
47	46	adantl 483	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑦 ∈ Fin)
48	18	ad2antrr 725	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝐹:𝐴⟶𝑆)
49		elfpw 9354	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑦 ∈ (𝒫 𝐴 ∩ Fin) ↔ (𝑦 ⊆ 𝐴 ∧ 𝑦 ∈ Fin))
50	49	simplbi 499	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑦 ∈ (𝒫 𝐴 ∩ Fin) → 𝑦 ⊆ 𝐴)
51	50	adantl 483	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑦 ⊆ 𝐴)
52	48, 51	fssresd 6759	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐹 ↾ 𝑦):𝑦⟶𝑆)
53	4	ad2antrr 725	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑆 = (Base‘𝐻))
54	53	feq3d 6705	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐹 ↾ 𝑦):𝑦⟶𝑆 ↔ (𝐹 ↾ 𝑦):𝑦⟶(Base‘𝐻)))
55	52, 54	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐹 ↾ 𝑦):𝑦⟶(Base‘𝐻))
56		fvex 6905	. . . . . . . . . . . . . . . . . . 19 ⊢ (0_g‘𝐻) ∈ V
57	56	a1i 11	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (0_g‘𝐻) ∈ V)
58	52, 47, 57	fdmfifsupp 9373	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐹 ↾ 𝑦) finSupp (0_g‘𝐻))
59	39, 40, 45, 47, 55, 58	gsumcl 19783	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (Base‘𝐻))
60	59, 53	eleqtrrd 2837	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑆)
61		elin 3965	. . . . . . . . . . . . . . . 16 ⊢ ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢 ∧ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑆))
62	61	rbaib 540	. . . . . . . . . . . . . . 15 ⊢ ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑆 → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
63	60, 62	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
64	1	ad2antrr 725	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → 𝑆 ∈ (SubMnd‘𝐺))
65	47, 64, 52, 2	gsumsubm 18716	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → (𝐺 Σ_g (𝐹 ↾ 𝑦)) = (𝐻 Σ_g (𝐹 ↾ 𝑦)))
66	65	eleq1d 2819	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢 ↔ (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
67	63, 66	bitr4d 282	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ (𝑢 ∩ 𝑆) ↔ (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
68	38, 67	sylan9bbr 512	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣 ↔ (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
69	68	an32s 651	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣 ↔ (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))
70	69	imbi2d 341	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) ∧ 𝑦 ∈ (𝒫 𝐴 ∩ Fin)) → ((𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣) ↔ (𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))
71	70	ralbidva 3176	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → (∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣) ↔ ∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))
72	71	rexbidv 3179	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → (∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣) ↔ ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢)))
73	37, 72	imbi12d 345	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑆) ∧ 𝑣 = (𝑢 ∩ 𝑆)) → ((𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)) ↔ (𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
74	25, 32, 73	ralxfr2d 5409	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)) ↔ ∀𝑢 ∈ (TopOpen‘𝐺)(𝑥 ∈ 𝑢 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐺 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑢))))
75	22, 74	bitr4d 282	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → (𝑥 ∈ (𝐺 tsums 𝐹) ↔ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣))))
76	75	pm5.32da 580	. . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝑆 ∧ 𝑥 ∈ (𝐺 tsums 𝐹)) ↔ (𝑥 ∈ 𝑆 ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
77	8, 76	bitrid 283	. . 3 ⊢ (𝜑 → (𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆) ↔ (𝑥 ∈ 𝑆 ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
78		eqid 2733	. . . 4 ⊢ (TopOpen‘𝐻) = (TopOpen‘𝐻)
79		resstps 22691	. . . . . 6 ⊢ ((𝐺 ∈ TopSp ∧ 𝑆 ∈ (SubMnd‘𝐺)) → (𝐺 ↾_s 𝑆) ∈ TopSp)
80	16, 1, 79	syl2anc 585	. . . . 5 ⊢ (𝜑 → (𝐺 ↾_s 𝑆) ∈ TopSp)
81	2, 80	eqeltrid 2838	. . . 4 ⊢ (𝜑 → 𝐻 ∈ TopSp)
82	4	feq3d 6705	. . . . 5 ⊢ (𝜑 → (𝐹:𝐴⟶𝑆 ↔ 𝐹:𝐴⟶(Base‘𝐻)))
83	18, 82	mpbid 231	. . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶(Base‘𝐻))
84	39, 78, 14, 44, 81, 17, 83	eltsms 23637	. . 3 ⊢ (𝜑 → (𝑥 ∈ (𝐻 tsums 𝐹) ↔ (𝑥 ∈ (Base‘𝐻) ∧ ∀𝑣 ∈ (TopOpen‘𝐻)(𝑥 ∈ 𝑣 → ∃𝑧 ∈ (𝒫 𝐴 ∩ Fin)∀𝑦 ∈ (𝒫 𝐴 ∩ Fin)(𝑧 ⊆ 𝑦 → (𝐻 Σ_g (𝐹 ↾ 𝑦)) ∈ 𝑣)))))
85	6, 77, 84	3bitr4rd 312	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐻 tsums 𝐹) ↔ 𝑥 ∈ ((𝐺 tsums 𝐹) ∩ 𝑆)))
86	85	eqrdv 2731	1 ⊢ (𝜑 → (𝐻 tsums 𝐹) = ((𝐺 tsums 𝐹) ∩ 𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ∩ cin 3948 ⊆ wss 3949 𝒫 cpw 4603 ↾ cres 5679 ⟶wf 6540 ‘cfv 6544 (class class class)co 7409 Fincfn 8939 Basecbs 17144 ↾_s cress 17173 ↾_t crest 17366 TopOpenctopn 17367 0_gc0g 17385 Σ_g cgsu 17386 Mndcmnd 18625 SubMndcsubmnd 18670 CMndccmn 19648 TopSpctps 22434 tsums ctsu 23630

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-supp 8147 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9362 df-fi 9406 df-oi 9505 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-uz 12823 df-fz 13485 df-fzo 13628 df-seq 13967 df-hash 14291 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-tset 17216 df-rest 17368 df-topn 17369 df-0g 17387 df-gsum 17388 df-topgen 17389 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-submnd 18672 df-cntz 19181 df-cmn 19650 df-fbas 20941 df-fg 20942 df-top 22396 df-topon 22413 df-topsp 22435 df-bases 22449 df-ntr 22524 df-nei 22602 df-fil 23350 df-fm 23442 df-flim 23443 df-flf 23444 df-tsms 23631

This theorem is referenced by: (None)

W3C validator