Theorem iscnrm3llem2 50203

Description: Lemma for iscnrm3l 50204. 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 46211.) (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 3938	. . 3 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → (𝐶 ⊆ 𝑙 ↔ 𝐶 ⊆ (𝑛 ∩ 𝑍)))
2		ineq1 4112	. . . 4 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → (𝑙 ∩ 𝑘) = ((𝑛 ∩ 𝑍) ∩ 𝑘))
3	2	eqeq1d 2765	. . 3 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → ((𝑙 ∩ 𝑘) = ∅ ↔ ((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅))
4	1, 3	3anbi13d 1466	. 2 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → ((𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅) ↔ (𝐶 ⊆ (𝑛 ∩ 𝑍) ∧ 𝐷 ⊆ 𝑘 ∧ ((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅)))
5		sseq2 3938	. . 3 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → (𝐷 ⊆ 𝑘 ↔ 𝐷 ⊆ (𝑚 ∩ 𝑍)))
6		ineq2 4113	. . . 4 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → ((𝑛 ∩ 𝑍) ∩ 𝑘) = ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)))
7	6	eqeq1d 2765	. . 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 17611	. . . 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 17611	. . . 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 2764	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ∪ 𝐽 = ∪ 𝐽)
19	10	elpwid 4568	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝑍 ⊆ ∪ 𝐽)
20		eqidd 2764	. . . . . 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 50166	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐶 ⊆ 𝑍)
23	17, 22	ssind 4139	. . . 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 50166	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ⊆ 𝑍)
27	24, 26	ssind 4139	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ⊆ (𝑚 ∩ 𝑍))
28		inss1 4135	. . . . . . 7 ⊢ (𝑛 ∩ 𝑍) ⊆ 𝑛
29		inss1 4135	. . . . . . 7 ⊢ (𝑚 ∩ 𝑍) ⊆ 𝑚
30		ss2in 4143	. . . . . . 7 ⊢ (((𝑛 ∩ 𝑍) ⊆ 𝑛 ∧ (𝑚 ∩ 𝑍) ⊆ 𝑚) → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ (𝑛 ∩ 𝑚))
31	28, 29, 30	mp2an 705	. . . . . 6 ⊢ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ (𝑛 ∩ 𝑚)
32		simp33 1230	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝑛 ∩ 𝑚) = ∅)
33	31, 32	sseqtrid 3954	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ ∅)
34		ss0 4354	. . . . 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 50192	1 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) → ∃𝑙 ∈ (𝐽 ↾t 𝑍)∃𝑘 ∈ (𝐽 ↾t 𝑍)(𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146  ∃wrex 3089   ⊆ wss 3899   ∩ cin 4091  ∅c0 4280  𝒫 cpw 4559  ∪ cuni 4869  ‘cfv 6546  (class class class)co 7427   ↾_t crest 17603  Topctop 23223  Clsdccld 23346

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-int 4910  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5549  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-we 5609  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ord 6371  df-on 6372  df-lim 6373  df-suc 6374  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-ov 7430  df-oprab 7431  df-mpo 7432  df-om 7885  df-1st 8008  df-2nd 8009  df-en 8985  df-fin 8988  df-fi 9413  df-rest 17605  df-topgen 17626  df-top 23224  df-topon 23241  df-bases 23276  df-cld 23349

This theorem is used by:  iscnrm3l  50204