Theorem iscnrm3llem2 49877

Description: Lemma for iscnrm3l 49878. If there exist disjoint open neighborhoods in the original topology for two disjoint closed sets in a subspace, then they can be separated by open neighborhoods in the subspace topology. (Could shorten proof with ssin0 45890.) (Contributed by Zhi Wang, 5-Sep-2024.)

Assertion

Ref	Expression
iscnrm3llem2	⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) → ∃𝑙 ∈ (𝐽 ↾t 𝑍)∃𝑘 ∈ (𝐽 ↾t 𝑍)(𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅)))

Distinct variable groups:   𝐶,𝑘,𝑙,𝑚,𝑛   𝐷,𝑘,𝑙,𝑚,𝑛   𝑘,𝐽,𝑙,𝑚,𝑛   𝑘,𝑍,𝑙,𝑚,𝑛

Proof of Theorem iscnrm3llem2

Step	Hyp	Ref	Expression
1		sseq2 3957	. . 3 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → (𝐶 ⊆ 𝑙 ↔ 𝐶 ⊆ (𝑛 ∩ 𝑍)))
2		ineq1 4159	. . . 4 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → (𝑙 ∩ 𝑘) = ((𝑛 ∩ 𝑍) ∩ 𝑘))
3	2	eqeq1d 2762	. . 3 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → ((𝑙 ∩ 𝑘) = ∅ ↔ ((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅))
4	1, 3	3anbi13d 1466	. 2 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → ((𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅) ↔ (𝐶 ⊆ (𝑛 ∩ 𝑍) ∧ 𝐷 ⊆ 𝑘 ∧ ((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅)))
5		sseq2 3957	. . 3 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → (𝐷 ⊆ 𝑘 ↔ 𝐷 ⊆ (𝑚 ∩ 𝑍)))
6		ineq2 4160	. . . 4 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → ((𝑛 ∩ 𝑍) ∩ 𝑘) = ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)))
7	6	eqeq1d 2762	. . 3 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → (((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅ ↔ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) = ∅))
8	5, 7	3anbi23d 1467	. 2 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → ((𝐶 ⊆ (𝑛 ∩ 𝑍) ∧ 𝐷 ⊆ 𝑘 ∧ ((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅) ↔ (𝐶 ⊆ (𝑛 ∩ 𝑍) ∧ 𝐷 ⊆ (𝑚 ∩ 𝑍) ∧ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) = ∅)))
9		simp11 1222	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐽 ∈ Top)
10		simp121 1324	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝑍 ∈ 𝒫 ∪ 𝐽)
11		simp2l 1218	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝑛 ∈ 𝐽)
12		elrestr 17514	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝑛 ∈ 𝐽) → (𝑛 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍))
13	9, 10, 11, 12	syl3anc 1398	. . 3 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝑛 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍))
14		simp2r 1219	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝑚 ∈ 𝐽)
15		elrestr 17514	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝑚 ∈ 𝐽) → (𝑚 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍))
16	9, 10, 14, 15	syl3anc 1398	. . 3 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝑚 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍))
17		simp31 1228	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐶 ⊆ 𝑛)
18		eqidd 2761	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ∪ 𝐽 = ∪ 𝐽)
19	10	elpwid 4566	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝑍 ⊆ ∪ 𝐽)
20		eqidd 2761	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝐽 ↾t 𝑍) = (𝐽 ↾t 𝑍))
21		simp122 1325	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)))
22	9, 18, 19, 20, 21	restcls2lem 49840	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐶 ⊆ 𝑍)
23	17, 22	ssind 4186	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐶 ⊆ (𝑛 ∩ 𝑍))
24		simp32 1229	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ⊆ 𝑚)
25		simp123 1326	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍)))
26	9, 18, 19, 20, 25	restcls2lem 49840	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ⊆ 𝑍)
27	24, 26	ssind 4186	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ⊆ (𝑚 ∩ 𝑍))
28		inss1 4182	. . . . . . 7 ⊢ (𝑛 ∩ 𝑍) ⊆ 𝑛
29		inss1 4182	. . . . . . 7 ⊢ (𝑚 ∩ 𝑍) ⊆ 𝑚
30		ss2in 4190	. . . . . . 7 ⊢ (((𝑛 ∩ 𝑍) ⊆ 𝑛 ∧ (𝑚 ∩ 𝑍) ⊆ 𝑚) → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ (𝑛 ∩ 𝑚))
31	28, 29, 30	mp2an 705	. . . . . 6 ⊢ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ (𝑛 ∩ 𝑚)
32		simp33 1230	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝑛 ∩ 𝑚) = ∅)
33	31, 32	sseqtrid 3973	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ ∅)
34		ss0 4352	. . . . 5 ⊢ (((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ ∅ → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) = ∅)
35	33, 34	syl 18	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) = ∅)
36	23, 27, 35	3jca 1146	. . 3 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝐶 ⊆ (𝑛 ∩ 𝑍) ∧ 𝐷 ⊆ (𝑚 ∩ 𝑍) ∧ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) = ∅))
37	13, 16, 36	3jca 1146	. 2 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ((𝑛 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍) ∧ (𝑚 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍) ∧ (𝐶 ⊆ (𝑛 ∩ 𝑍) ∧ 𝐷 ⊆ (𝑚 ∩ 𝑍) ∧ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) = ∅)))
38	4, 8, 37	iscnrm3lem7 49866	1 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) → ∃𝑙 ∈ (𝐽 ↾t 𝑍)∃𝑘 ∈ (𝐽 ↾t 𝑍)(𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∃wrex 3086   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6533  (class class class)co 7414   ↾_t crest 17506  Topctop 23119  Clsdccld 23242

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  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-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-en 8954  df-fin 8957  df-fi 9382  df-rest 17508  df-topgen 17529  df-top 23120  df-topon 23137  df-bases 23172  df-cld 23245

This theorem is used by:  iscnrm3l  49878