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 22766

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 22062	. . . . . 6 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑅 ∈ Top)
4	2, 3	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑅 ∈ Top)
5		ptcls.c	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ 𝑋)
6		toponuni 22063	. . . . . . . 8 ⊢ (𝑅 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝑅)
7	2, 6	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑋 = ∪ 𝑅)
8	5, 7	sseqtrd 3961	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ ∪ 𝑅)
9		eqid 2738	. . . . . . 7 ⊢ ∪ 𝑅 = ∪ 𝑅
10	9	clscld 22198	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝑅))
11	4, 8, 10	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝑅))
12	1, 4, 11	ptcldmpt 22765	. . . 4 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ∈ (Clsd‘(∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅))))
13		ptcls.2	. . . . 5 ⊢ 𝐽 = (∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅))
14	13	fveq2i 6777	. . . 4 ⊢ (Clsd‘𝐽) = (Clsd‘(∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅)))
15	12, 14	eleqtrrdi 2850	. . 3 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝐽))
16	9	sscls 22207	. . . . . 6 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → 𝑆 ⊆ ((cls‘𝑅)‘𝑆))
17	4, 8, 16	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑆 ⊆ ((cls‘𝑅)‘𝑆))
18	17	ralrimiva 3103	. . . 4 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑆 ⊆ ((cls‘𝑅)‘𝑆))
19		ss2ixp 8698	. . . 4 ⊢ (∀𝑘 ∈ 𝐴 𝑆 ⊆ ((cls‘𝑅)‘𝑆) → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
20	18, 19	syl 17	. . 3 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
21		eqid 2738	. . . 4 ⊢ ∪ 𝐽 = ∪ 𝐽
22	21	clsss2 22223	. . 3 ⊢ ((X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ∈ (Clsd‘𝐽) ∧ X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
23	15, 20, 22	syl2anc 584	. 2 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) ⊆ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))
24		vex 3436	. . . . . 6 ⊢ 𝑢 ∈ V
25		eqeq1 2742	. . . . . . . 8 ⊢ (𝑥 = 𝑢 → (𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) ↔ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
26	25	anbi2d 629	. . . . . . 7 ⊢ (𝑥 = 𝑢 → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))))
27	26	exbidv 1924	. . . . . 6 ⊢ (𝑥 = 𝑢 → (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) ↔ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))))
28	24, 27	elab 3609	. . . . 5 ⊢ (𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ↔ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
29		nffvmpt1 6785	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)
30	29	nfel2 2925	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘(𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)
31		nfv 1917	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑦(𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘)
32		fveq2 6774	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → (𝑔‘𝑦) = (𝑔‘𝑘))
33		fveq2 6774	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑘 → ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) = ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘))
34	32, 33	eleq12d 2833	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑘 → ((𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ↔ (𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘)))
35	30, 31, 34	cbvralw 3373	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ↔ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘))
36		simpr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ 𝐴)
37		eqid 2738	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ 𝐴 ↦ 𝑅) = (𝑘 ∈ 𝐴 ↦ 𝑅)
38	37	fvmpt2 6886	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ 𝐴 ∧ 𝑅 ∈ (TopOn‘𝑋)) → ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) = 𝑅)
39	36, 2, 38	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) = 𝑅)
40	39	eleq2d 2824	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) ↔ (𝑔‘𝑘) ∈ 𝑅))
41	40	ralbidva 3111	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑘) ↔ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅))
42	35, 41	bitrid 282	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ↔ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅))
43	42	anbi2d 629	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ↔ (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)))
44	43	adantr 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → ((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ↔ (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)))
45	44	biimpa 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅))
46		ptclsg.1	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴)
47	46	ad2antrr 723	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴)
48		simpll 764	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → 𝜑)
49		vex 3436	. . . . . . . . . . . . . . . . . . . 20 ⊢ 𝑓 ∈ V
50	49	elixp 8692	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆)))
51	50	simprbi 497	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆))
52	51	ad2antlr 724	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆))
53	9	clsndisj 22226	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅 ∧ (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆)) ∧ ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘))) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
54	53	ex 413	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅 ∧ (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆)) → (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
55	54	3expia 1120	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → ((𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆) → (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)))
56	4, 8, 55	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆) → (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)))
57	56	ralimdva 3108	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → (∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ ((cls‘𝑅)‘𝑆) → ∀𝑘 ∈ 𝐴 (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)))
58	48, 52, 57	sylc 65	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
59		simprlr 777	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)
60		simprr 770	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))
61	32	cbvixpv 8703	. . . . . . . . . . . . . . . . . . 19 ⊢ X𝑦 ∈ 𝐴 (𝑔‘𝑦) = X𝑘 ∈ 𝐴 (𝑔‘𝑘)
62	60, 61	eleqtrdi 2849	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → 𝑓 ∈ X𝑘 ∈ 𝐴 (𝑔‘𝑘))
63	49	elixp 8692	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 (𝑔‘𝑘) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘)))
64	63	simprbi 497	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓 ∈ X𝑘 ∈ 𝐴 (𝑔‘𝑘) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘))
65	62, 64	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘))
66		r19.26 3095	. . . . . . . . . . . . . . . . 17 ⊢ (∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) ↔ (∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅 ∧ ∀𝑘 ∈ 𝐴 (𝑓‘𝑘) ∈ (𝑔‘𝑘)))
67	59, 65, 66	sylanbrc 583	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)))
68		ralim 3083	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑘 ∈ 𝐴 (((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅) → (∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∈ 𝑅 ∧ (𝑓‘𝑘) ∈ (𝑔‘𝑘)) → ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
69	58, 67, 68	sylc 65	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
70		rabn0 4319	. . . . . . . . . . . . . . . . 17 ⊢ ({𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)} ≠ ∅ ↔ ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆))
71		dfin5 3895	. . . . . . . . . . . . . . . . . . 19 ⊢ (∪ 𝑘 ∈ 𝐴 𝑆 ∩ ((𝑔‘𝑘) ∩ 𝑆)) = {𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)}
72		inss2 4163	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑔‘𝑘) ∩ 𝑆) ⊆ 𝑆
73		ssiun2 4977	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ 𝐴 → 𝑆 ⊆ ∪ 𝑘 ∈ 𝐴 𝑆)
74	72, 73	sstrid 3932	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ 𝐴 → ((𝑔‘𝑘) ∩ 𝑆) ⊆ ∪ 𝑘 ∈ 𝐴 𝑆)
75		sseqin2 4149	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑔‘𝑘) ∩ 𝑆) ⊆ ∪ 𝑘 ∈ 𝐴 𝑆 ↔ (∪ 𝑘 ∈ 𝐴 𝑆 ∩ ((𝑔‘𝑘) ∩ 𝑆)) = ((𝑔‘𝑘) ∩ 𝑆))
76	74, 75	sylib 217	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ 𝐴 → (∪ 𝑘 ∈ 𝐴 𝑆 ∩ ((𝑔‘𝑘) ∩ 𝑆)) = ((𝑔‘𝑘) ∩ 𝑆))
77	71, 76	eqtr3id 2792	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ 𝐴 → {𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)} = ((𝑔‘𝑘) ∩ 𝑆))
78	77	neeq1d 3003	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ 𝐴 → ({𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆 ∣ 𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)} ≠ ∅ ↔ ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
79	70, 78	bitr3id 285	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝐴 → (∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅))
80	79	ralbiia 3091	. . . . . . . . . . . . . . 15 ⊢ (∀𝑘 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∀𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
81	69, 80	sylibr 233	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑘 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆))
82		nfv 1917	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑦∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆)
83		nfiu1 4958	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘∪ 𝑘 ∈ 𝐴 𝑆
84		nfcv 2907	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘(𝑔‘𝑦)
85		nfcsb1v 3857	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑘⦋𝑦 / 𝑘⦌𝑆
86	84, 85	nfin 4150	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑘((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
87	86	nfel2 2925	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘 𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
88	83, 87	nfrex 3242	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑘∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
89		fveq2 6774	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑦 → (𝑔‘𝑘) = (𝑔‘𝑦))
90		csbeq1a 3846	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 = 𝑦 → 𝑆 = ⦋𝑦 / 𝑘⦌𝑆)
91	89, 90	ineq12d 4147	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑦 → ((𝑔‘𝑘) ∩ 𝑆) = ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
92	91	eleq2d 2824	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑦 → (𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ 𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
93	92	rexbidv 3226	. . . . . . . . . . . . . . 15 ⊢ (𝑘 = 𝑦 → (∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
94	82, 88, 93	cbvralw 3373	. . . . . . . . . . . . . 14 ⊢ (∀𝑘 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
95	81, 94	sylib 217	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
96		eleq1 2826	. . . . . . . . . . . . . 14 ⊢ (𝑧 = (ℎ‘𝑦) → (𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆) ↔ (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
97	96	acni3 9803	. . . . . . . . . . . . 13 ⊢ ((∪ 𝑘 ∈ 𝐴 𝑆 ∈ AC 𝐴 ∧ ∀𝑦 ∈ 𝐴 ∃𝑧 ∈ ∪ 𝑘 ∈ 𝐴 𝑆𝑧 ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → ∃ℎ(ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
98	47, 95, 97	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → ∃ℎ(ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
99		ffn 6600	. . . . . . . . . . . . . 14 ⊢ (ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 → ℎ Fn 𝐴)
100		nfv 1917	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑦(ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆)
101	86	nfel2 2925	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑘(ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)
102		fveq2 6774	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 = 𝑦 → (ℎ‘𝑘) = (ℎ‘𝑦))
103	102, 91	eleq12d 2833	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 = 𝑦 → ((ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)))
104	100, 101, 103	cbvralw 3373	. . . . . . . . . . . . . . 15 ⊢ (∀𝑘 ∈ 𝐴 (ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆) ↔ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆))
105		ne0i 4268	. . . . . . . . . . . . . . . 16 ⊢ (ℎ ∈ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) → X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅)
106		vex 3436	. . . . . . . . . . . . . . . . 17 ⊢ ℎ ∈ V
107	106	elixp 8692	. . . . . . . . . . . . . . . 16 ⊢ (ℎ ∈ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ↔ (ℎ Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆)))
108		ixpin 8711	. . . . . . . . . . . . . . . . . 18 ⊢ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) = (X𝑘 ∈ 𝐴 (𝑔‘𝑘) ∩ X𝑘 ∈ 𝐴 𝑆)
109	61	ineq1i 4142	. . . . . . . . . . . . . . . . . 18 ⊢ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) = (X𝑘 ∈ 𝐴 (𝑔‘𝑘) ∩ X𝑘 ∈ 𝐴 𝑆)
110	108, 109	eqtr4i 2769	. . . . . . . . . . . . . . . . 17 ⊢ X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) = (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆)
111	110	neeq1i 3008	. . . . . . . . . . . . . . . 16 ⊢ (X𝑘 ∈ 𝐴 ((𝑔‘𝑘) ∩ 𝑆) ≠ ∅ ↔ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
112	105, 107, 111	3imtr3i 291	. . . . . . . . . . . . . . 15 ⊢ ((ℎ Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (ℎ‘𝑘) ∈ ((𝑔‘𝑘) ∩ 𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
113	104, 112	sylan2br 595	. . . . . . . . . . . . . 14 ⊢ ((ℎ Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
114	99, 113	sylan 580	. . . . . . . . . . . . 13 ⊢ ((ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
115	114	exlimiv 1933	. . . . . . . . . . . 12 ⊢ (∃ℎ(ℎ:𝐴⟶∪ 𝑘 ∈ 𝐴 𝑆 ∧ ∀𝑦 ∈ 𝐴 (ℎ‘𝑦) ∈ ((𝑔‘𝑦) ∩ ⦋𝑦 / 𝑘⦌𝑆)) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
116	98, 115	syl 17	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ ((𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅) ∧ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦))) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)
117	116	expr 457	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 (𝑔‘𝑘) ∈ 𝑅)) → (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
118	45, 117	syldan 591	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
119	118	3adantr3 1170	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
120		eleq2 2827	. . . . . . . . 9 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑓 ∈ 𝑢 ↔ 𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦)))
121		ineq1 4139	. . . . . . . . . 10 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) = (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆))
122	121	neeq1d 3003	. . . . . . . . 9 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → ((𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅ ↔ (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
123	120, 122	imbi12d 345	. . . . . . . 8 ⊢ (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → ((𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅) ↔ (𝑓 ∈ X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (X𝑦 ∈ 𝐴 (𝑔‘𝑦) ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
124	119, 123	syl5ibrcom 246	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) ∧ (𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦))) → (𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦) → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
125	124	expimpd 454	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
126	125	exlimdv 1936	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑢 = X𝑦 ∈ 𝐴 (𝑔‘𝑦)) → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
127	28, 126	syl5bi 241	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} → (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
128	127	ralrimiv 3102	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → ∀𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅))
129	4	fmpttd 6989	. . . . . . . 8 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑅):𝐴⟶Top)
130	129	ffnd 6601	. . . . . . 7 ⊢ (𝜑 → (𝑘 ∈ 𝐴 ↦ 𝑅) Fn 𝐴)
131		eqid 2738	. . . . . . . 8 ⊢ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} = {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}
132	131	ptval 22721	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑘 ∈ 𝐴 ↦ 𝑅) Fn 𝐴) → (∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅)) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
133	1, 130, 132	syl2anc 584	. . . . . 6 ⊢ (𝜑 → (∏_t‘(𝑘 ∈ 𝐴 ↦ 𝑅)) = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
134	13, 133	eqtrid 2790	. . . . 5 ⊢ (𝜑 → 𝐽 = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
135	134	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → 𝐽 = (topGen‘{𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))}))
136	2	ralrimiva 3103	. . . . . . 7 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑅 ∈ (TopOn‘𝑋))
137	13	pttopon 22747	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ ∀𝑘 ∈ 𝐴 𝑅 ∈ (TopOn‘𝑋)) → 𝐽 ∈ (TopOn‘X𝑘 ∈ 𝐴 𝑋))
138	1, 136, 137	syl2anc 584	. . . . . 6 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘X𝑘 ∈ 𝐴 𝑋))
139		toponuni 22063	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘X𝑘 ∈ 𝐴 𝑋) → X𝑘 ∈ 𝐴 𝑋 = ∪ 𝐽)
140	138, 139	syl 17	. . . . 5 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑋 = ∪ 𝐽)
141	140	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → X𝑘 ∈ 𝐴 𝑋 = ∪ 𝐽)
142	131	ptbas 22730	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑘 ∈ 𝐴 ↦ 𝑅):𝐴⟶Top) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
143	1, 129, 142	syl2anc 584	. . . . 5 ⊢ (𝜑 → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
144	143	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} ∈ TopBases)
145	5	ralrimiva 3103	. . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝑆 ⊆ 𝑋)
146		ss2ixp 8698	. . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 𝑆 ⊆ 𝑋 → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 𝑋)
147	145, 146	syl 17	. . . . 5 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 𝑋)
148	147	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → X𝑘 ∈ 𝐴 𝑆 ⊆ X𝑘 ∈ 𝐴 𝑋)
149	9	clsss3 22210	. . . . . . . . 9 ⊢ ((𝑅 ∈ Top ∧ 𝑆 ⊆ ∪ 𝑅) → ((cls‘𝑅)‘𝑆) ⊆ ∪ 𝑅)
150	4, 8, 149	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((cls‘𝑅)‘𝑆) ⊆ ∪ 𝑅)
151	150, 7	sseqtrrd 3962	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → ((cls‘𝑅)‘𝑆) ⊆ 𝑋)
152	151	ralrimiva 3103	. . . . . 6 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ 𝑋)
153		ss2ixp 8698	. . . . . 6 ⊢ (∀𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ 𝑋 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ X𝑘 ∈ 𝐴 𝑋)
154	152, 153	syl 17	. . . . 5 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆) ⊆ X𝑘 ∈ 𝐴 𝑋)
155	154	sselda 3921	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → 𝑓 ∈ X𝑘 ∈ 𝐴 𝑋)
156	135, 141, 144, 148, 155	elcls3 22234	. . 3 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → (𝑓 ∈ ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) ↔ ∀𝑢 ∈ {𝑥 ∣ ∃𝑔((𝑔 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) ∈ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦) ∧ ∃𝑧 ∈ Fin ∀𝑦 ∈ (𝐴 ∖ 𝑧)(𝑔‘𝑦) = ∪ ((𝑘 ∈ 𝐴 ↦ 𝑅)‘𝑦)) ∧ 𝑥 = X𝑦 ∈ 𝐴 (𝑔‘𝑦))} (𝑓 ∈ 𝑢 → (𝑢 ∩ X𝑘 ∈ 𝐴 𝑆) ≠ ∅)))
157	128, 156	mpbird 256	. 2 ⊢ ((𝜑 ∧ 𝑓 ∈ X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆)) → 𝑓 ∈ ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆))
158	23, 157	eqelssd 3942	1 ⊢ (𝜑 → ((cls‘𝐽)‘X𝑘 ∈ 𝐴 𝑆) = X𝑘 ∈ 𝐴 ((cls‘𝑅)‘𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∃wex 1782 ∈ wcel 2106 {cab 2715 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 {crab 3068 ⦋csb 3832 ∖ cdif 3884 ∩ cin 3886 ⊆ wss 3887 ∅c0 4256 ∪ cuni 4839 ∪ ciun 4924 ↦ cmpt 5157 Fn wfn 6428 ⟶wf 6429 ‘cfv 6433 Xcixp 8685 Fincfn 8733 AC wacn 9696 topGenctg 17148 ∏_tcpt 17149 Topctop 22042 TopOnctopon 22059 TopBasesctb 22095 Clsdccld 22167 clsccl 22169

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1o 8297 df-er 8498 df-map 8617 df-ixp 8686 df-en 8734 df-fin 8737 df-fi 9170 df-acn 9700 df-topgen 17154 df-pt 17155 df-top 22043 df-topon 22060 df-bases 22096 df-cld 22170 df-ntr 22171 df-cls 22172

This theorem is referenced by: ptcls 22767 dfac14 22769

W3C validator