Theorem ptcld 23621

Description: A closed box in the product topology. (Contributed by Stefan O'Rear, 22-Feb-2015.)

Hypotheses

Ref	Expression
ptcld.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
ptcld.f	⊢ (𝜑 → 𝐹:𝐴⟶Top)
ptcld.c	⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ (Clsd‘(𝐹‘𝑘)))

Assertion

Ref	Expression
ptcld	⊢ (𝜑 → X𝑘 ∈ 𝐴 𝐶 ∈ (Clsd‘(∏t‘𝐹)))

Distinct variable groups:   𝜑,𝑘   𝐴,𝑘   𝑘,𝐹   𝑘,𝑉

Allowed substitution hint:   𝐶(𝑘)

Proof of Theorem ptcld

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ptcld.c	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ∈ (Clsd‘(𝐹‘𝑘)))
2		eqid 2737	. . . . . 6 ⊢ ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝑘)
3	2	cldss 23037	. . . . 5 ⊢ (𝐶 ∈ (Clsd‘(𝐹‘𝑘)) → 𝐶 ⊆ ∪ (𝐹‘𝑘))
4	1, 3	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝐴) → 𝐶 ⊆ ∪ (𝐹‘𝑘))
5	4	ralrimiva 3146	. . 3 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ⊆ ∪ (𝐹‘𝑘))
6		boxriin 8980	. . 3 ⊢ (∀𝑘 ∈ 𝐴 𝐶 ⊆ ∪ (𝐹‘𝑘) → X𝑘 ∈ 𝐴 𝐶 = (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∩ ∩ 𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))))
7	5, 6	syl 17	. 2 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝐶 = (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∩ ∩ 𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))))
8		ptcld.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
9		ptcld.f	. . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶Top)
10		eqid 2737	. . . . . 6 ⊢ (∏t‘𝐹) = (∏t‘𝐹)
11	10	ptuni 23602	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ (∏t‘𝐹))
12	8, 9, 11	syl2anc 584	. . . 4 ⊢ (𝜑 → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ (∏t‘𝐹))
13	12	ineq1d 4219	. . 3 ⊢ (𝜑 → (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∩ ∩ 𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) = (∪ (∏t‘𝐹) ∩ ∩ 𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))))
14		pttop 23590	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶Top) → (∏t‘𝐹) ∈ Top)
15	8, 9, 14	syl2anc 584	. . . 4 ⊢ (𝜑 → (∏t‘𝐹) ∈ Top)
16		sseq1 4009	. . . . . . . . . . 11 ⊢ (𝐶 = if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) → (𝐶 ⊆ ∪ (𝐹‘𝑘) ↔ if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘)))
17		sseq1 4009	. . . . . . . . . . 11 ⊢ (∪ (𝐹‘𝑘) = if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) → (∪ (𝐹‘𝑘) ⊆ ∪ (𝐹‘𝑘) ↔ if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘)))
18		simpl 482	. . . . . . . . . . 11 ⊢ ((𝐶 ⊆ ∪ (𝐹‘𝑘) ∧ 𝑘 = 𝑥) → 𝐶 ⊆ ∪ (𝐹‘𝑘))
19		ssidd 4007	. . . . . . . . . . 11 ⊢ ((𝐶 ⊆ ∪ (𝐹‘𝑘) ∧ ¬ 𝑘 = 𝑥) → ∪ (𝐹‘𝑘) ⊆ ∪ (𝐹‘𝑘))
20	16, 17, 18, 19	ifbothda 4564	. . . . . . . . . 10 ⊢ (𝐶 ⊆ ∪ (𝐹‘𝑘) → if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘))
21	20	ralimi 3083	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 𝐶 ⊆ ∪ (𝐹‘𝑘) → ∀𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘))
22		ss2ixp 8950	. . . . . . . . 9 ⊢ (∀𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (𝐹‘𝑘) → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
23	5, 21, 22	3syl 18	. . . . . . . 8 ⊢ (𝜑 → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
24	23	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
25	12	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) = ∪ (∏t‘𝐹))
26	24, 25	sseqtrd 4020	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (∏t‘𝐹))
27	12	eqcomd 2743	. . . . . . . . . 10 ⊢ (𝜑 → ∪ (∏t‘𝐹) = X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘))
28	27	difeq1d 4125	. . . . . . . . 9 ⊢ (𝜑 → (∪ (∏t‘𝐹) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) = (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))))
29	28	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∪ (∏t‘𝐹) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) = (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))))
30		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
31	5	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∀𝑘 ∈ 𝐴 𝐶 ⊆ ∪ (𝐹‘𝑘))
32		boxcutc 8981	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ ∀𝑘 ∈ 𝐴 𝐶 ⊆ ∪ (𝐹‘𝑘)) → (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) = X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑘) ∖ 𝐶), ∪ (𝐹‘𝑘)))
33	30, 31, 32	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) = X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑘) ∖ 𝐶), ∪ (𝐹‘𝑘)))
34		ixpeq2 8951	. . . . . . . . . 10 ⊢ (∀𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑘) ∖ 𝐶), ∪ (𝐹‘𝑘)) = if(𝑘 = 𝑥, (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶), ∪ (𝐹‘𝑘)) → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑘) ∖ 𝐶), ∪ (𝐹‘𝑘)) = X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶), ∪ (𝐹‘𝑘)))
35		fveq2 6906	. . . . . . . . . . . . . 14 ⊢ (𝑘 = 𝑥 → (𝐹‘𝑘) = (𝐹‘𝑥))
36	35	unieqd 4920	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑥 → ∪ (𝐹‘𝑘) = ∪ (𝐹‘𝑥))
37		csbeq1a 3913	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑥 → 𝐶 = ⦋𝑥 / 𝑘⦌𝐶)
38	36, 37	difeq12d 4127	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑥 → (∪ (𝐹‘𝑘) ∖ 𝐶) = (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶))
39	38	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ 𝐴 ∧ 𝑘 = 𝑥) → (∪ (𝐹‘𝑘) ∖ 𝐶) = (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶))
40	39	ifeq1da 4557	. . . . . . . . . 10 ⊢ (𝑘 ∈ 𝐴 → if(𝑘 = 𝑥, (∪ (𝐹‘𝑘) ∖ 𝐶), ∪ (𝐹‘𝑘)) = if(𝑘 = 𝑥, (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶), ∪ (𝐹‘𝑘)))
41	34, 40	mprg 3067	. . . . . . . . 9 ⊢ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑘) ∖ 𝐶), ∪ (𝐹‘𝑘)) = X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶), ∪ (𝐹‘𝑘))
42	41	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑘) ∖ 𝐶), ∪ (𝐹‘𝑘)) = X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶), ∪ (𝐹‘𝑘)))
43	29, 33, 42	3eqtrd 2781	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∪ (∏t‘𝐹) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) = X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶), ∪ (𝐹‘𝑘)))
44	8	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐴 ∈ 𝑉)
45	9	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐹:𝐴⟶Top)
46	1	ralrimiva 3146	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑘 ∈ 𝐴 𝐶 ∈ (Clsd‘(𝐹‘𝑘)))
47		nfv 1914	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥 𝐶 ∈ (Clsd‘(𝐹‘𝑘))
48		nfcsb1v 3923	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑘⦋𝑥 / 𝑘⦌𝐶
49	48	nfel1 2922	. . . . . . . . . . . 12 ⊢ Ⅎ𝑘⦋𝑥 / 𝑘⦌𝐶 ∈ (Clsd‘(𝐹‘𝑥))
50		2fveq3 6911	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑥 → (Clsd‘(𝐹‘𝑘)) = (Clsd‘(𝐹‘𝑥)))
51	37, 50	eleq12d 2835	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑥 → (𝐶 ∈ (Clsd‘(𝐹‘𝑘)) ↔ ⦋𝑥 / 𝑘⦌𝐶 ∈ (Clsd‘(𝐹‘𝑥))))
52	47, 49, 51	cbvralw 3306	. . . . . . . . . . 11 ⊢ (∀𝑘 ∈ 𝐴 𝐶 ∈ (Clsd‘(𝐹‘𝑘)) ↔ ∀𝑥 ∈ 𝐴 ⦋𝑥 / 𝑘⦌𝐶 ∈ (Clsd‘(𝐹‘𝑥)))
53	46, 52	sylib 218	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ⦋𝑥 / 𝑘⦌𝐶 ∈ (Clsd‘(𝐹‘𝑥)))
54	53	r19.21bi 3251	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ⦋𝑥 / 𝑘⦌𝐶 ∈ (Clsd‘(𝐹‘𝑥)))
55		eqid 2737	. . . . . . . . . 10 ⊢ ∪ (𝐹‘𝑥) = ∪ (𝐹‘𝑥)
56	55	cldopn 23039	. . . . . . . . 9 ⊢ (⦋𝑥 / 𝑘⦌𝐶 ∈ (Clsd‘(𝐹‘𝑥)) → (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶) ∈ (𝐹‘𝑥))
57	54, 56	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶) ∈ (𝐹‘𝑥))
58	44, 45, 57	ptopn2 23592	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, (∪ (𝐹‘𝑥) ∖ ⦋𝑥 / 𝑘⦌𝐶), ∪ (𝐹‘𝑘)) ∈ (∏t‘𝐹))
59	43, 58	eqeltrd 2841	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (∪ (∏t‘𝐹) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) ∈ (∏t‘𝐹))
60		eqid 2737	. . . . . . . . 9 ⊢ ∪ (∏t‘𝐹) = ∪ (∏t‘𝐹)
61	60	iscld 23035	. . . . . . . 8 ⊢ ((∏t‘𝐹) ∈ Top → (X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ∈ (Clsd‘(∏t‘𝐹)) ↔ (X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (∏t‘𝐹) ∧ (∪ (∏t‘𝐹) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) ∈ (∏t‘𝐹))))
62	15, 61	syl 17	. . . . . . 7 ⊢ (𝜑 → (X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ∈ (Clsd‘(∏t‘𝐹)) ↔ (X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (∏t‘𝐹) ∧ (∪ (∏t‘𝐹) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) ∈ (∏t‘𝐹))))
63	62	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ∈ (Clsd‘(∏t‘𝐹)) ↔ (X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ⊆ ∪ (∏t‘𝐹) ∧ (∪ (∏t‘𝐹) ∖ X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) ∈ (∏t‘𝐹))))
64	26, 59, 63	mpbir2and 713	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ∈ (Clsd‘(∏t‘𝐹)))
65	64	ralrimiva 3146	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ∈ (Clsd‘(∏t‘𝐹)))
66	60	riincld 23052	. . . 4 ⊢ (((∏t‘𝐹) ∈ Top ∧ ∀𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘)) ∈ (Clsd‘(∏t‘𝐹))) → (∪ (∏t‘𝐹) ∩ ∩ 𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) ∈ (Clsd‘(∏t‘𝐹)))
67	15, 65, 66	syl2anc 584	. . 3 ⊢ (𝜑 → (∪ (∏t‘𝐹) ∩ ∩ 𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) ∈ (Clsd‘(∏t‘𝐹)))
68	13, 67	eqeltrd 2841	. 2 ⊢ (𝜑 → (X𝑘 ∈ 𝐴 ∪ (𝐹‘𝑘) ∩ ∩ 𝑥 ∈ 𝐴 X𝑘 ∈ 𝐴 if(𝑘 = 𝑥, 𝐶, ∪ (𝐹‘𝑘))) ∈ (Clsd‘(∏t‘𝐹)))
69	7, 68	eqeltrd 2841	1 ⊢ (𝜑 → X𝑘 ∈ 𝐴 𝐶 ∈ (Clsd‘(∏t‘𝐹)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∀wral 3061  ⦋csb 3899   ∖ cdif 3948   ∩ cin 3950   ⊆ wss 3951  ifcif 4525  ∪ cuni 4907  ∩ ciin 4992  ⟶wf 6557  ‘cfv 6561  Xcixp 8937  ∏_tcpt 17483  Topctop 22899  Clsdccld 23024

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-iin 4994  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-om 7888  df-1o 8506  df-2o 8507  df-ixp 8938  df-en 8986  df-fin 8989  df-fi 9451  df-topgen 17488  df-pt 17489  df-top 22900  df-bases 22953  df-cld 23027

This theorem is referenced by:  ptcldmpt  23622