ptclsg - Metamath Proof Explorer

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

Theorem ptclsg 23677

Description: The closure of a box in the product topology is the box formed from the closures of the factors. The proof uses the axiom of choice; the last hypothesis is the choice assumption. (Contributed by Mario Carneiro, 3-Sep-2015.)

**Hypotheses**
Ref	Expression
ptcls.2	⊢ 𝐽 = (∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅))
ptcls.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
ptcls.j	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑅 ∈ (TopOn‘𝑋))
ptcls.c	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ 𝑋)
ptclsg.1	⊢ (𝜑 → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴)

**Assertion**
Ref	Expression
ptclsg	⊢ (𝜑 → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) = X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))

Distinct variable groups: 𝜑,𝑘 𝐴,𝑘 Allowed substitution hints: 𝑅(𝑘) 𝑆(𝑘) 𝐽(𝑘) 𝑉(𝑘) 𝑋(𝑘)

Proof of Theorem ptclsg Dummy variables 𝑓 𝑔 𝑢 𝑥 𝑦 𝑧 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ptcls.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		ptcls.j	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑅 ∈ (TopOn‘𝑋))
3		topontop 22975	. . . . . 6 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑅 ∈ Top)
4	2, 3	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑅 ∈ Top)
5		ptcls.c	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ 𝑋)
6		toponuni 22976	. . . . . . . 8 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑅)
7	2, 6	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 = ∪ 𝑅)
8	5, 7	sseqtrd 3974	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ ∪ 𝑅)
9		eqid 2764	. . . . . . 7 ⊢ ∪ 𝑅 = ∪ 𝑅
10	9	clscld 23109	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝑅))
11	4, 8, 10	syl2anc 593	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝑅))
12	1, 4, 11	ptcldmpt 23676	. . . 4 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ∈ (Clsd‘(∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅))))
13		ptcls.2	. . . . 5 ⊢ 𝐽 = (∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅))
14	13	fveq2i 6872	. . . 4 ⊢ (Clsd‘𝐽) = (Clsd‘(∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅)))
15	12, 14	eleqtrrdi 2875	. . 3 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝐽))
16	9	sscls 23118	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → 𝑆 ⊆ ((cls‘𝑅)‘𝑆))
17	4, 8, 16	syl2anc 593	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ ((cls‘𝑅)‘𝑆))
18	17	ralrimiva 3156	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑆 ⊆ ((cls‘𝑅)‘𝑆))
19		ss2ixp 8894	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 𝑆 ⊆ ((cls‘𝑅)‘𝑆) → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
20	18, 19	syl 17	. . 3 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
21		eqid 2764	. . . 4 ⊢ ∪ 𝐽 = ∪ 𝐽
22	21	clsss2 23134	. . 3 ⊢ ((X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝐽) ∧ X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
23	15, 20, 22	syl2anc 593	. 2 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
24		vex 3460	. . . . . 6 ⊢ 𝑢 ∈ V
25		eqeq1 2768	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) ↔ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
26	25	anbi2d 639	. . . . . . 7 ⊢ (𝑥 = 𝑢 → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))))
27	26	exbidv 1943	. . . . . 6 ⊢ (𝑥 = 𝑢 → (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))))
28	24, 27	elab 3640	. . . . 5 ⊢ (𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ↔ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
29		nffvmpt1 6880	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)
30	29	nfel2 2944	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘(𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)
31		nfv 1936	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑦(𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘)
32		fveq2 6869	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → (𝑔‘𝑦) = (𝑔‘𝑘))
33		fveq2 6869	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) = ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘))
34	32, 33	eleq12d 2858	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑘 → ((𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ↔ (𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘)))
35	30, 31, 34	cbvralw 3306	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ↔ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘))
36		simpr 488	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴)
37		eqid 2764	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ 𝐴 ↦ 𝑅) = (𝑘 ∈ 𝐴 ↦ 𝑅)
38	37	fvmpt2 6989	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ 𝐴 ∧ 𝑅 ∈ (TopOn‘𝑋)) → ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) = 𝑅)
39	36, 2, 38	syl2anc 593	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) = 𝑅)
40	39	eleq2d 2850	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) ↔ (𝑔‘𝑘) ∈ 𝑅))
41	40	ralbidva 3185	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) ↔ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅))
42	35, 41	bitrid 285	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ↔ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅))
43	42	anbi2d 639	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ↔ (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)))
44	43	adantr 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ↔ (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)))
45	44	biimpa 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅))
46		ptclsg.1	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴)
47	46	ad2antrr 736	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴)
48		simpll 776	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → 𝜑)
49		vex 3460	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑓 ∈ V
50	49	elixp 8888	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆)))
51	50	simprbi 501	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆))
52	51	ad2antlr 737	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆))
53	9	clsndisj 23137	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅 ∧ (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆)) ∧ ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘))) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
54	53	ex 416	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅 ∧ (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆)) → (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
55	54	3expia 1135	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → ((𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆) → (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)))
56	4, 8, 55	syl2anc 593	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆) → (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)))
57	56	ralimdva 3176	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆) → ∀𝑘 ∈ 𝐴 (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)))
58	48, 52, 57	sylc 65	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
59		simprlr 789	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)
60		simprr 782	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))
61	32	cbvixpv 8899	. . . . . . . . . . . . . . . . . . 19 ⊢ X𝑦 ∈ 𝐴 (𝑔‘𝑦) = X𝑘 ∈ 𝐴 (𝑔‘𝑘)
62	60, 61	eleqtrdi 2874	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → 𝑓 ∈ X𝑘 ∈ 𝐴 (𝑔‘𝑘))
63	49	elixp 8888	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 (𝑔‘𝑘) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘)))
64	63	simprbi 501	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 (𝑔‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘))
65	62, 64	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘))
66		r19.26 3124	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) ↔ (∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅 ∧ ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘)))
67	59, 65, 66	sylanbrc 592	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)))
68		ralim 3104	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑘 ∈ 𝐴 (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅) → (∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
69	58, 67, 68	sylc 65	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
70		rabn0 4345	. . . . . . . . . . . . . . . . 17 ⊢ ({𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)} ≠ ∅ ↔ ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆))
71		dfin5 3914	. . . . . . . . . . . . . . . . . . 19 ⊢ (∪ 𝑘 ∈ 𝐴 𝑆 ∩ ((𝑔‘𝑘) ∩ 𝑆)) = {𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)}
72		inss2 4191	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔‘𝑘) ∩ 𝑆) ⊆ 𝑆
73		ssiun2 5007	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ 𝐴 → 𝑆 ⊆ ∪ 𝑘 ∈ 𝐴 𝑆)
74	72, 73	sstrid 3949	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ 𝐴 → ((𝑔‘𝑘) ∩ 𝑆) ⊆ ∪ 𝑘 ∈ 𝐴 𝑆)
75		sseqin2 4177	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑔‘𝑘) ∩ 𝑆) ⊆ ∪ 𝑘 ∈ 𝐴 𝑆 ↔ (∪ 𝑘 ∈ 𝐴 𝑆 ∩ ((𝑔‘𝑘) ∩ 𝑆)) = ((𝑔‘𝑘) ∩ 𝑆))
76	74, 75	sylib 220	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ 𝐴 → (∪ 𝑘 ∈ 𝐴 𝑆 ∩ ((𝑔‘𝑘) ∩ 𝑆)) = ((𝑔‘𝑘) ∩ 𝑆))
77	71, 76	eqtr3id 2813	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ 𝐴 → {𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)} = ((𝑔‘𝑘) ∩ 𝑆))
78	77	neeq1d 3018	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ 𝐴 → ({𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)} ≠ ∅ ↔ ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
79	70, 78	bitr3id 287	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝐴 → (∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
80	79	ralbiia 3108	. . . . . . . . . . . . . . 15 ⊢ (∀𝑘 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
81	69, 80	sylibr 236	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆))
82		nfv 1936	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑦∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)
83		nfiu1 4987	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘∪ 𝑘 ∈ 𝐴 𝑆
84		nfcv 2926	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘(𝑔‘𝑦)
85		nfcsb1v 3878	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘⦋𝑦 / 𝑘⦌𝑆
86	84, 85	nfin 4178	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
87	86	nfel2 2944	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘 𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
88	83, 87	nfrexw 3312	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
89		fveq2 6869	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑦 → (𝑔‘𝑘) = (𝑔‘𝑦))
90		csbeq1a 3868	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑦 → 𝑆 = ⦋𝑦 / 𝑘⦌𝑆)
91	89, 90	ineq12d 4175	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑦 → ((𝑔‘𝑘) ∩ 𝑆) = ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
92	91	eleq2d 2850	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑦 → (𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ 𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
93	92	rexbidv 3188	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑦 → (∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
94	82, 88, 93	cbvralw 3306	. . . . . . . . . . . . . 14 ⊢ (∀𝑘 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
95	81, 94	sylib 220	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
96		eleq1 2852	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (ℎ‘𝑦) → (𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆) ↔ (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
97	96	acni3 10005	. . . . . . . . . . . . 13 ⊢ ((∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴 ∧ ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → ∃ℎ(ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
98	47, 95, 97	syl2anc 593	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∃ℎ(ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
99		ffn 6693	. . . . . . . . . . . . . 14 ⊢ (ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 → ℎ Fn 𝐴)
100		nfv 1936	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑦(ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆)
101	86	nfel2 2944	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘(ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
102		fveq2 6869	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑦 → (ℎ‘𝑘) = (ℎ‘𝑦))
103	102, 91	eleq12d 2858	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑦 → ((ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
104	100, 101, 103	cbvralw 3306	. . . . . . . . . . . . . . 15 ⊢ (∀𝑘 ∈ 𝐴 (ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
105		ne0i 4295	. . . . . . . . . . . . . . . 16 ⊢ (ℎ ∈ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) → X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
106		vex 3460	. . . . . . . . . . . . . . . . 17 ⊢ ℎ ∈ V
107	106	elixp 8888	. . . . . . . . . . . . . . . 16 ⊢ (ℎ ∈ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ↔ (ℎ Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆)))
108		ixpin 8907	. . . . . . . . . . . . . . . . . 18 ⊢ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) = (X𝑘 ∈ 𝐴 (𝑔‘𝑘) ∩ X𝑘 ∈ 𝐴 𝑆)
109	61	ineq1i 4170	. . . . . . . . . . . . . . . . . 18 ⊢ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) = (X𝑘 ∈ 𝐴 (𝑔‘𝑘) ∩ X𝑘 ∈ 𝐴 𝑆)
110	108, 109	eqtr4i 2790	. . . . . . . . . . . . . . . . 17 ⊢ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) = (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆)
111	110	neeq1i 3023	. . . . . . . . . . . . . . . 16 ⊢ (X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅ ↔ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
112	105, 107, 111	3imtr3i 293	. . . . . . . . . . . . . . 15 ⊢ ((ℎ Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
113	104, 112	sylan2br 604	. . . . . . . . . . . . . 14 ⊢ ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
114	99, 113	sylan 589	. . . . . . . . . . . . 13 ⊢ ((ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
115	114	exlimiv 1952	. . . . . . . . . . . 12 ⊢ (∃ℎ(ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
116	98, 115	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
117	116	expr 460	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)) → (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
118	45, 117	syldan 600	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
119	118	3adantr3 1186	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
120		eleq2 2853	. . . . . . . . 9 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑓 ∈ 𝑢 ↔ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
121		ineq1 4167	. . . . . . . . . 10 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) = (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆))
122	121	neeq1d 3018	. . . . . . . . 9 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → ((𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅ ↔ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
123	120, 122	imbi12d 346	. . . . . . . 8 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → ((𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅) ↔ (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
124	119, 123	syl5ibrcom 249	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
125	124	expimpd 457	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
126	125	exlimdv 1955	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
127	28, 126	biimtrid 244	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
128	127	ralrimiv 3155	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → ∀𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
129	4	fmpttd 7098	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑅):𝐴⟶Top)
130	129	ffnd 6694	. . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑅) Fn 𝐴)
131		eqid 2764	. . . . . . . 8 ⊢ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
132	131	ptval 23632	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑘 ∈ 𝐴 ↦ 𝑅) Fn 𝐴) → (∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅)) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
133	1, 130, 132	syl2anc 593	. . . . . 6 ⊢ (𝜑 → (∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅)) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
134	13, 133	eqtrid 2811	. . . . 5 ⊢ (𝜑 → 𝐽 = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
135	134	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → 𝐽 = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
136	2	ralrimiva 3156	. . . . . . 7 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑅 ∈ (TopOn‘𝑋))
137	13	pttopon 23658	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐴 𝑅 ∈ (TopOn‘𝑋)) → 𝐽 ∈ (TopOn‘X𝑘 ∈ 𝐴 𝑋))
138	1, 136, 137	syl2anc 593	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘X𝑘 ∈ 𝐴 𝑋))
139		toponuni 22976	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘X𝑘 ∈ 𝐴 𝑋) → X𝑘 ∈ 𝐴 𝑋 = ∪ 𝐽)
140	138, 139	syl 17	. . . . 5 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑋 = ∪ 𝐽)
141	140	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → X𝑘 ∈ 𝐴 𝑋 = ∪ 𝐽)
142	131	ptbas 23641	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑘 ∈ 𝐴 ↦ 𝑅):𝐴⟶Top) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
143	1, 129, 142	syl2anc 593	. . . . 5 ⊢ (𝜑 → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
144	143	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
145	5	ralrimiva 3156	. . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑆 ⊆ 𝑋)
146		ss2ixp 8894	. . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 𝑆 ⊆ 𝑋 → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 𝑋)
147	145, 146	syl 17	. . . . 5 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 𝑋)
148	147	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 𝑋)
149	9	clsss3 23121	. . . . . . . . 9 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → ((cls‘𝑅)‘𝑆) ⊆ ∪ 𝑅)
150	4, 8, 149	syl2anc 593	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((cls‘𝑅)‘𝑆) ⊆ ∪ 𝑅)
151	150, 7	sseqtrrd 3975	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((cls‘𝑅)‘𝑆) ⊆ 𝑋)
152	151	ralrimiva 3156	. . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ 𝑋)
153		ss2ixp 8894	. . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ 𝑋 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ X𝑘 ∈ 𝐴 𝑋)
154	152, 153	syl 17	. . . . 5 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ X𝑘 ∈ 𝐴 𝑋)
155	154	sselda 3938	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → 𝑓 ∈ X𝑘 ∈ 𝐴 𝑋)
156	135, 141, 144, 148, 155	elcls3 23145	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (𝑓 ∈ ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) ↔ ∀𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
157	128, 156	mpbird 259	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → 𝑓 ∈ ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆))
158	23, 157	eqelssd 3959	1 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) = X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∃wex 1801 ∈ wcel 2144 {cab 2742 ≠ wne 2959 ∀wral 3078 ∃wrex 3088 {crab 3416 ⦋csb 3854 ∖ cdif 3903 ∩ cin 3905 ⊆ wss 3906 ∅c0 4287 ∪ cuni 4867 ∪ ciun 4951 ↦ cmpt 5183 Fn wfn 6518 ⟶wf 6519 ‘cfv 6523 Xcixp 8881 Fincfn 8929 AC wacn 9898 topGenctg 17468 ∏_tcpt 17469 Topctop 22955 TopOnctopon 22972 TopBasesctb 23007 Clsdccld 23078 clsccl 23080

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5544 df-eprel 5549 df-po 5557 df-so 5558 df-fr 5602 df-we 5604 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-ord 6351 df-on 6352 df-lim 6353 df-suc 6354 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-ov 7401 df-oprab 7402 df-mpo 7403 df-om 7849 df-1o 8439 df-2o 8440 df-map 8812 df-ixp 8882 df-en 8930 df-fin 8933 df-fi 9359 df-acn 9902 df-topgen 17474 df-pt 17475 df-top 22956 df-topon 22973 df-bases 23008 df-cld 23081 df-ntr 23082 df-cls 23083

This theorem is referenced by: ptcls 23678 dfac14 23680

W3C validator