Theorem tmdgsum2 22706

Description: For any neighborhood 𝑈 of 𝑛𝑋, there is a neighborhood 𝑢 of 𝑋 such that any sum of 𝑛 elements in 𝑢 sums to an element of 𝑈. (Contributed by Mario Carneiro, 19-Sep-2015.)

Hypotheses

Ref	Expression
tmdgsum.j	⊢ 𝐽 = (TopOpen‘𝐺)
tmdgsum.b	⊢ 𝐵 = (Base‘𝐺)
tmdgsum2.t	⊢ · = (.g‘𝐺)
tmdgsum2.1	⊢ (𝜑 → 𝐺 ∈ CMnd)
tmdgsum2.2	⊢ (𝜑 → 𝐺 ∈ TopMnd)
tmdgsum2.a	⊢ (𝜑 → 𝐴 ∈ Fin)
tmdgsum2.u	⊢ (𝜑 → 𝑈 ∈ 𝐽)
tmdgsum2.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
tmdgsum2.3	⊢ (𝜑 → ((♯‘𝐴) · 𝑋) ∈ 𝑈)

Assertion

Ref	Expression
tmdgsum2	⊢ (𝜑 → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))

Distinct variable groups:   𝑢,𝑓,𝐴   𝑓,𝐽,𝑢   𝑓,𝑋,𝑢   𝐵,𝑓,𝑢   𝑓,𝐺,𝑢   𝑈,𝑓,𝑢

Allowed substitution hints:   𝜑(𝑢,𝑓)   · (𝑢,𝑓)

Proof of Theorem tmdgsum2

Dummy variables 𝑔 𝑘 𝑡 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2823	. . . . . . 7 ⊢ (𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓)) = (𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓))
2	1	mptpreima 6094	. . . . . 6 ⊢ (◡(𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓)) “ 𝑈) = {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}
3		tmdgsum2.1	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ CMnd)
4		tmdgsum2.2	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ TopMnd)
5		tmdgsum2.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ Fin)
6		tmdgsum.j	. . . . . . . . 9 ⊢ 𝐽 = (TopOpen‘𝐺)
7		tmdgsum.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝐺)
8	6, 7	tmdgsum 22705	. . . . . . . 8 ⊢ ((𝐺 ∈ CMnd ∧ 𝐺 ∈ TopMnd ∧ 𝐴 ∈ Fin) → (𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓)) ∈ ((𝐽 ↑ko 𝒫 𝐴) Cn 𝐽))
9	3, 4, 5, 8	syl3anc 1367	. . . . . . 7 ⊢ (𝜑 → (𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓)) ∈ ((𝐽 ↑ko 𝒫 𝐴) Cn 𝐽))
10		tmdgsum2.u	. . . . . . 7 ⊢ (𝜑 → 𝑈 ∈ 𝐽)
11		cnima 21875	. . . . . . 7 ⊢ (((𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓)) ∈ ((𝐽 ↑ko 𝒫 𝐴) Cn 𝐽) ∧ 𝑈 ∈ 𝐽) → (◡(𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓)) “ 𝑈) ∈ (𝐽 ↑ko 𝒫 𝐴))
12	9, 10, 11	syl2anc 586	. . . . . 6 ⊢ (𝜑 → (◡(𝑓 ∈ (𝐵 ↑m 𝐴) ↦ (𝐺 Σg 𝑓)) “ 𝑈) ∈ (𝐽 ↑ko 𝒫 𝐴))
13	2, 12	eqeltrrid 2920	. . . . 5 ⊢ (𝜑 → {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈} ∈ (𝐽 ↑ko 𝒫 𝐴))
14	6, 7	tmdtopon 22691	. . . . . . . 8 ⊢ (𝐺 ∈ TopMnd → 𝐽 ∈ (TopOn‘𝐵))
15		topontop 21523	. . . . . . . 8 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐽 ∈ Top)
16	4, 14, 15	3syl 18	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Top)
17		xkopt 22265	. . . . . . 7 ⊢ ((𝐽 ∈ Top ∧ 𝐴 ∈ Fin) → (𝐽 ↑ko 𝒫 𝐴) = (∏t‘(𝐴 × {𝐽})))
18	16, 5, 17	syl2anc 586	. . . . . 6 ⊢ (𝜑 → (𝐽 ↑ko 𝒫 𝐴) = (∏t‘(𝐴 × {𝐽})))
19		fnconstg 6569	. . . . . . . 8 ⊢ (𝐽 ∈ (TopOn‘𝐵) → (𝐴 × {𝐽}) Fn 𝐴)
20	4, 14, 19	3syl 18	. . . . . . 7 ⊢ (𝜑 → (𝐴 × {𝐽}) Fn 𝐴)
21		eqid 2823	. . . . . . . 8 ⊢ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
22	21	ptval 22180	. . . . . . 7 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 × {𝐽}) Fn 𝐴) → (∏t‘(𝐴 × {𝐽})) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
23	5, 20, 22	syl2anc 586	. . . . . 6 ⊢ (𝜑 → (∏t‘(𝐴 × {𝐽})) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
24	18, 23	eqtrd 2858	. . . . 5 ⊢ (𝜑 → (𝐽 ↑ko 𝒫 𝐴) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
25	13, 24	eleqtrd 2917	. . . 4 ⊢ (𝜑 → {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈} ∈ (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
26		oveq2 7166	. . . . . 6 ⊢ (𝑓 = (𝐴 × {𝑋}) → (𝐺 Σg 𝑓) = (𝐺 Σg (𝐴 × {𝑋})))
27	26	eleq1d 2899	. . . . 5 ⊢ (𝑓 = (𝐴 × {𝑋}) → ((𝐺 Σg 𝑓) ∈ 𝑈 ↔ (𝐺 Σg (𝐴 × {𝑋})) ∈ 𝑈))
28		tmdgsum2.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
29		fconst6g 6570	. . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → (𝐴 × {𝑋}):𝐴⟶𝐵)
30	28, 29	syl 17	. . . . . 6 ⊢ (𝜑 → (𝐴 × {𝑋}):𝐴⟶𝐵)
31	7	fvexi 6686	. . . . . . 7 ⊢ 𝐵 ∈ V
32		elmapg 8421	. . . . . . 7 ⊢ ((𝐵 ∈ V ∧ 𝐴 ∈ Fin) → ((𝐴 × {𝑋}) ∈ (𝐵 ↑m 𝐴) ↔ (𝐴 × {𝑋}):𝐴⟶𝐵))
33	31, 5, 32	sylancr 589	. . . . . 6 ⊢ (𝜑 → ((𝐴 × {𝑋}) ∈ (𝐵 ↑m 𝐴) ↔ (𝐴 × {𝑋}):𝐴⟶𝐵))
34	30, 33	mpbird 259	. . . . 5 ⊢ (𝜑 → (𝐴 × {𝑋}) ∈ (𝐵 ↑m 𝐴))
35		fconstmpt 5616	. . . . . . . 8 ⊢ (𝐴 × {𝑋}) = (𝑘 ∈ 𝐴 ↦ 𝑋)
36	35	oveq2i 7169	. . . . . . 7 ⊢ (𝐺 Σg (𝐴 × {𝑋})) = (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋))
37		cmnmnd 18924	. . . . . . . . 9 ⊢ (𝐺 ∈ CMnd → 𝐺 ∈ Mnd)
38	3, 37	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐺 ∈ Mnd)
39		tmdgsum2.t	. . . . . . . . 9 ⊢ · = (.g‘𝐺)
40	7, 39	gsumconst 19056	. . . . . . . 8 ⊢ ((𝐺 ∈ Mnd ∧ 𝐴 ∈ Fin ∧ 𝑋 ∈ 𝐵) → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) = ((♯‘𝐴) · 𝑋))
41	38, 5, 28, 40	syl3anc 1367	. . . . . . 7 ⊢ (𝜑 → (𝐺 Σg (𝑘 ∈ 𝐴 ↦ 𝑋)) = ((♯‘𝐴) · 𝑋))
42	36, 41	syl5eq 2870	. . . . . 6 ⊢ (𝜑 → (𝐺 Σg (𝐴 × {𝑋})) = ((♯‘𝐴) · 𝑋))
43		tmdgsum2.3	. . . . . 6 ⊢ (𝜑 → ((♯‘𝐴) · 𝑋) ∈ 𝑈)
44	42, 43	eqeltrd 2915	. . . . 5 ⊢ (𝜑 → (𝐺 Σg (𝐴 × {𝑋})) ∈ 𝑈)
45	27, 34, 44	elrabd 3684	. . . 4 ⊢ (𝜑 → (𝐴 × {𝑋}) ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})
46		tg2 21575	. . . 4 ⊢ (({𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈} ∈ (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}) ∧ (𝐴 × {𝑋}) ∈ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑡 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ((𝐴 × {𝑋}) ∈ 𝑡 ∧ 𝑡 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}))
47	25, 45, 46	syl2anc 586	. . 3 ⊢ (𝜑 → ∃𝑡 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ((𝐴 × {𝑋}) ∈ 𝑡 ∧ 𝑡 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}))
48		eleq2 2903	. . . . 5 ⊢ (𝑡 = 𝑥 → ((𝐴 × {𝑋}) ∈ 𝑡 ↔ (𝐴 × {𝑋}) ∈ 𝑥))
49		sseq1 3994	. . . . 5 ⊢ (𝑡 = 𝑥 → (𝑡 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈} ↔ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}))
50	48, 49	anbi12d 632	. . . 4 ⊢ (𝑡 = 𝑥 → (((𝐴 × {𝑋}) ∈ 𝑡 ∧ 𝑡 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) ↔ ((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})))
51	50	rexab2 3693	. . 3 ⊢ (∃𝑡 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ((𝐴 × {𝑋}) ∈ 𝑡 ∧ 𝑡 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) ↔ ∃𝑥(∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ∧ ((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})))
52	47, 51	sylib 220	. 2 ⊢ (𝜑 → ∃𝑥(∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ∧ ((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})))
53		toponuni 21524	. . . . . . . . . . . . . 14 ⊢ (𝐽 ∈ (TopOn‘𝐵) → 𝐵 = ∪ 𝐽)
54	4, 14, 53	3syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐵 = ∪ 𝐽)
55	54	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝐵 = ∪ 𝐽)
56	55	ineq1d 4190	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → (𝐵 ∩ ∩ ran 𝑔) = (∪ 𝐽 ∩ ∩ ran 𝑔))
57	16	ad2antrr 724	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝐽 ∈ Top)
58		simplrl 775	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝑔 Fn 𝐴)
59		simplrr 776	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))
60		fvconst2g 6966	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ 𝐴) → ((𝐴 × {𝐽})‘𝑦) = 𝐽)
61	60	eleq2d 2900	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐽 ∈ Top ∧ 𝑦 ∈ 𝐴) → ((𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ↔ (𝑔‘𝑦) ∈ 𝐽))
62	61	ralbidva 3198	. . . . . . . . . . . . . . . 16 ⊢ (𝐽 ∈ Top → (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ 𝐽))
63	57, 62	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ↔ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ 𝐽))
64	59, 63	mpbid 234	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ 𝐽)
65		ffnfv 6884	. . . . . . . . . . . . . 14 ⊢ (𝑔:𝐴⟶𝐽 ↔ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ 𝐽))
66	58, 64, 65	sylanbrc 585	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝑔:𝐴⟶𝐽)
67	66	frnd 6523	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ran 𝑔 ⊆ 𝐽)
68	5	ad2antrr 724	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝐴 ∈ Fin)
69		dffn4 6598	. . . . . . . . . . . . . 14 ⊢ (𝑔 Fn 𝐴 ↔ 𝑔:𝐴–onto→ran 𝑔)
70	58, 69	sylib 220	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝑔:𝐴–onto→ran 𝑔)
71		fofi 8812	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Fin ∧ 𝑔:𝐴–onto→ran 𝑔) → ran 𝑔 ∈ Fin)
72	68, 70, 71	syl2anc 586	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ran 𝑔 ∈ Fin)
73		eqid 2823	. . . . . . . . . . . . 13 ⊢ ∪ 𝐽 = ∪ 𝐽
74	73	rintopn 21519	. . . . . . . . . . . 12 ⊢ ((𝐽 ∈ Top ∧ ran 𝑔 ⊆ 𝐽 ∧ ran 𝑔 ∈ Fin) → (∪ 𝐽 ∩ ∩ ran 𝑔) ∈ 𝐽)
75	57, 67, 72, 74	syl3anc 1367	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → (∪ 𝐽 ∩ ∩ ran 𝑔) ∈ 𝐽)
76	56, 75	eqeltrd 2915	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → (𝐵 ∩ ∩ ran 𝑔) ∈ 𝐽)
77	28	ad2antrr 724	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝑋 ∈ 𝐵)
78		fconstmpt 5616	. . . . . . . . . . . . . 14 ⊢ (𝐴 × {𝑋}) = (𝑦 ∈ 𝐴 ↦ 𝑋)
79		simprl 769	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → (𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))
80	78, 79	eqeltrrid 2920	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → (𝑦 ∈ 𝐴 ↦ 𝑋) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))
81		mptelixpg 8501	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Fin → ((𝑦 ∈ 𝐴 ↦ 𝑋) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝐴 𝑋 ∈ (𝑔‘𝑦)))
82	68, 81	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ((𝑦 ∈ 𝐴 ↦ 𝑋) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ↔ ∀𝑦 ∈ 𝐴 𝑋 ∈ (𝑔‘𝑦)))
83	80, 82	mpbid 234	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∀𝑦 ∈ 𝐴 𝑋 ∈ (𝑔‘𝑦))
84		eleq2 2903	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (𝑔‘𝑦) → (𝑋 ∈ 𝑧 ↔ 𝑋 ∈ (𝑔‘𝑦)))
85	84	ralrn 6856	. . . . . . . . . . . . 13 ⊢ (𝑔 Fn 𝐴 → (∀𝑧 ∈ ran 𝑔 𝑋 ∈ 𝑧 ↔ ∀𝑦 ∈ 𝐴 𝑋 ∈ (𝑔‘𝑦)))
86	58, 85	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → (∀𝑧 ∈ ran 𝑔 𝑋 ∈ 𝑧 ↔ ∀𝑦 ∈ 𝐴 𝑋 ∈ (𝑔‘𝑦)))
87	83, 86	mpbird 259	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∀𝑧 ∈ ran 𝑔 𝑋 ∈ 𝑧)
88		elrint 4919	. . . . . . . . . . 11 ⊢ (𝑋 ∈ (𝐵 ∩ ∩ ran 𝑔) ↔ (𝑋 ∈ 𝐵 ∧ ∀𝑧 ∈ ran 𝑔 𝑋 ∈ 𝑧))
89	77, 87, 88	sylanbrc 585	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → 𝑋 ∈ (𝐵 ∩ ∩ ran 𝑔))
90	31	inex1 5223	. . . . . . . . . . . . 13 ⊢ (𝐵 ∩ ∩ ran 𝑔) ∈ V
91		ixpconstg 8472	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Fin ∧ (𝐵 ∩ ∩ ran 𝑔) ∈ V) → X𝑦 ∈ 𝐴 (𝐵 ∩ ∩ ran 𝑔) = ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴))
92	68, 90, 91	sylancl 588	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → X𝑦 ∈ 𝐴 (𝐵 ∩ ∩ ran 𝑔) = ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴))
93		inss2 4208	. . . . . . . . . . . . . . 15 ⊢ (𝐵 ∩ ∩ ran 𝑔) ⊆ ∩ ran 𝑔
94		fnfvelrn 6850	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 Fn 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑔‘𝑦) ∈ ran 𝑔)
95		intss1 4893	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔‘𝑦) ∈ ran 𝑔 → ∩ ran 𝑔 ⊆ (𝑔‘𝑦))
96	94, 95	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝑔 Fn 𝐴 ∧ 𝑦 ∈ 𝐴) → ∩ ran 𝑔 ⊆ (𝑔‘𝑦))
97	93, 96	sstrid 3980	. . . . . . . . . . . . . 14 ⊢ ((𝑔 Fn 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝐵 ∩ ∩ ran 𝑔) ⊆ (𝑔‘𝑦))
98	97	ralrimiva 3184	. . . . . . . . . . . . 13 ⊢ (𝑔 Fn 𝐴 → ∀𝑦 ∈ 𝐴 (𝐵 ∩ ∩ ran 𝑔) ⊆ (𝑔‘𝑦))
99		ss2ixp 8476	. . . . . . . . . . . . 13 ⊢ (∀𝑦 ∈ 𝐴 (𝐵 ∩ ∩ ran 𝑔) ⊆ (𝑔‘𝑦) → X𝑦 ∈ 𝐴 (𝐵 ∩ ∩ ran 𝑔) ⊆ X𝑦 ∈ 𝐴 (𝑔‘𝑦))
100	58, 98, 99	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → X𝑦 ∈ 𝐴 (𝐵 ∩ ∩ ran 𝑔) ⊆ X𝑦 ∈ 𝐴 (𝑔‘𝑦))
101	92, 100	eqsstrrd 4008	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴) ⊆ X𝑦 ∈ 𝐴 (𝑔‘𝑦))
102		ssrab 4051	. . . . . . . . . . . . 13 ⊢ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈} ↔ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ (𝐵 ↑m 𝐴) ∧ ∀𝑓 ∈ X 𝑦 ∈ 𝐴 (𝑔‘𝑦)(𝐺 Σg 𝑓) ∈ 𝑈))
103	102	simprbi 499	. . . . . . . . . . . 12 ⊢ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈} → ∀𝑓 ∈ X 𝑦 ∈ 𝐴 (𝑔‘𝑦)(𝐺 Σg 𝑓) ∈ 𝑈)
104	103	ad2antll 727	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∀𝑓 ∈ X 𝑦 ∈ 𝐴 (𝑔‘𝑦)(𝐺 Σg 𝑓) ∈ 𝑈)
105		ssralv 4035	. . . . . . . . . . 11 ⊢ (((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴) ⊆ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (∀𝑓 ∈ X 𝑦 ∈ 𝐴 (𝑔‘𝑦)(𝐺 Σg 𝑓) ∈ 𝑈 → ∀𝑓 ∈ ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))
106	101, 104, 105	sylc 65	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∀𝑓 ∈ ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)
107		eleq2 2903	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝐵 ∩ ∩ ran 𝑔) → (𝑋 ∈ 𝑢 ↔ 𝑋 ∈ (𝐵 ∩ ∩ ran 𝑔)))
108		oveq1 7165	. . . . . . . . . . . . 13 ⊢ (𝑢 = (𝐵 ∩ ∩ ran 𝑔) → (𝑢 ↑m 𝐴) = ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴))
109	108	raleqdv 3417	. . . . . . . . . . . 12 ⊢ (𝑢 = (𝐵 ∩ ∩ ran 𝑔) → (∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈 ↔ ∀𝑓 ∈ ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))
110	107, 109	anbi12d 632	. . . . . . . . . . 11 ⊢ (𝑢 = (𝐵 ∩ ∩ ran 𝑔) → ((𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈) ↔ (𝑋 ∈ (𝐵 ∩ ∩ ran 𝑔) ∧ ∀𝑓 ∈ ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)))
111	110	rspcev 3625	. . . . . . . . . 10 ⊢ (((𝐵 ∩ ∩ ran 𝑔) ∈ 𝐽 ∧ (𝑋 ∈ (𝐵 ∩ ∩ ran 𝑔) ∧ ∀𝑓 ∈ ((𝐵 ∩ ∩ ran 𝑔) ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))
112	76, 89, 106, 111	syl12anc 834	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) ∧ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))
113	112	ex 415	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦))) → (((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)))
114	113	3adantr3 1167	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦))) → (((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)))
115		eleq2 2903	. . . . . . . . 9 ⊢ (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → ((𝐴 × {𝑋}) ∈ 𝑥 ↔ (𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
116		sseq1 3994	. . . . . . . . 9 ⊢ (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈} ↔ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}))
117	115, 116	anbi12d 632	. . . . . . . 8 ⊢ (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) ↔ ((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})))
118	117	imbi1d 344	. . . . . . 7 ⊢ (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → ((((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)) ↔ (((𝐴 × {𝑋}) ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∧ X𝑦 ∈ 𝐴 (𝑔‘𝑦) ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))))
119	114, 118	syl5ibrcom 249	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦))) → (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))))
120	119	expimpd 456	. . . . 5 ⊢ (𝜑 → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → (((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))))
121	120	exlimdv 1934	. . . 4 ⊢ (𝜑 → (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → (((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈}) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))))
122	121	impd 413	. . 3 ⊢ (𝜑 → ((∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ∧ ((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)))
123	122	exlimdv 1934	. 2 ⊢ (𝜑 → (∃𝑥(∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝐴 × {𝐽})‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝐴 × {𝐽})‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ∧ ((𝐴 × {𝑋}) ∈ 𝑥 ∧ 𝑥 ⊆ {𝑓 ∈ (𝐵 ↑m 𝐴) ∣ (𝐺 Σg 𝑓) ∈ 𝑈})) → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈)))
124	52, 123	mpd 15	1 ⊢ (𝜑 → ∃𝑢 ∈ 𝐽 (𝑋 ∈ 𝑢 ∧ ∀𝑓 ∈ (𝑢 ↑m 𝐴)(𝐺 Σg 𝑓) ∈ 𝑈))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537  ∃wex 1780   ∈ wcel 2114  {cab 2801  ∀wral 3140  ∃wrex 3141  {crab 3144  Vcvv 3496   ∖ cdif 3935   ∩ cin 3937   ⊆ wss 3938  𝒫 cpw 4541  {csn 4569  ∪ cuni 4840  ∩ cint 4878   ↦ cmpt 5148   × cxp 5555  ^◡ccnv 5556  ran crn 5558   “ cima 5560   Fn wfn 6352  ⟶wf 6353  –onto→wfo 6355  ‘cfv 6357  (class class class)co 7158   ↑_m cmap 8408  Xcixp 8463  Fincfn 8511  ♯chash 13693  Basecbs 16485  TopOpenctopn 16697  topGenctg 16713  ∏_tcpt 16714   Σ_g cgsu 16716  Mndcmnd 17913  ._gcmg 18226  CMndccmn 18908  Topctop 21503  TopOnctopon 21520   Cn ccn 21834   ↑_ko cxko 22171  TopMndctmd 22680

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-iin 4924  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-se 5517  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-isom 6366  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-of 7411  df-om 7583  df-1st 7691  df-2nd 7692  df-supp 7833  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-2o 8105  df-oadd 8108  df-er 8291  df-map 8410  df-ixp 8464  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-fsupp 8836  df-fi 8877  df-oi 8976  df-card 9370  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-n0 11901  df-z 11985  df-uz 12247  df-fz 12896  df-fzo 13037  df-seq 13373  df-hash 13694  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-rest 16698  df-0g 16717  df-gsum 16718  df-topgen 16719  df-pt 16720  df-mre 16859  df-mrc 16860  df-acs 16862  df-plusf 17853  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-submnd 17959  df-mulg 18227  df-cntz 18449  df-cmn 18910  df-top 21504  df-topon 21521  df-topsp 21543  df-bases 21556  df-cn 21837  df-cnp 21838  df-cmp 21997  df-tx 22172  df-xko 22173  df-tmd 22682

This theorem is referenced by:  tsmsxp  22765