Theorem iscnrm3llem2 50395

Description: Lemma for iscnrm3l 50396. 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 46346.) (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 3939	. . 3 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → (𝐶 ⊆ 𝑙 ↔ 𝐶 ⊆ (𝑛 ∩ 𝑍)))
2		ineq1 4113	. . . 4 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → (𝑙 ∩ 𝑘) = ((𝑛 ∩ 𝑍) ∩ 𝑘))
3	2	eqeq1d 2765	. . 3 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → ((𝑙 ∩ 𝑘) = ∅ ↔ ((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅))
4	1, 3	3anbi13d 1467	. 2 ⊢ (𝑙 = (𝑛 ∩ 𝑍) → ((𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅) ↔ (𝐶 ⊆ (𝑛 ∩ 𝑍) ∧ 𝐷 ⊆ 𝑘 ∧ ((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅)))
5		sseq2 3939	. . 3 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → (𝐷 ⊆ 𝑘 ↔ 𝐷 ⊆ (𝑚 ∩ 𝑍)))
6		ineq2 4114	. . . 4 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → ((𝑛 ∩ 𝑍) ∩ 𝑘) = ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)))
7	6	eqeq1d 2765	. . 3 ⊢ (𝑘 = (𝑚 ∩ 𝑍) → (((𝑛 ∩ 𝑍) ∩ 𝑘) = ∅ ↔ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) = ∅))
8	5, 7	3anbi23d 1468	. 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 17649	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝑛 ∈ 𝐽) → (𝑛 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍))
13	9, 10, 11, 12	syl3anc 1399	. . 3 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝑛 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍))
14		simp2r 1219	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝑚 ∈ 𝐽)
15		elrestr 17649	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝑚 ∈ 𝐽) → (𝑚 ∩ 𝑍) ∈ (𝐽 ↾t 𝑍))
16	9, 10, 14, 15	syl3anc 1399	. . 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 4569	. . . . . 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 50358	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐶 ⊆ 𝑍)
23	17, 22	ssind 4140	. . . 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 50358	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ⊆ 𝑍)
27	24, 26	ssind 4140	. . . 4 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → 𝐷 ⊆ (𝑚 ∩ 𝑍))
28		inss1 4136	. . . . . . 7 ⊢ (𝑛 ∩ 𝑍) ⊆ 𝑛
29		inss1 4136	. . . . . . 7 ⊢ (𝑚 ∩ 𝑍) ⊆ 𝑚
30		ss2in 4144	. . . . . . 7 ⊢ (((𝑛 ∩ 𝑍) ⊆ 𝑛 ∧ (𝑚 ∩ 𝑍) ⊆ 𝑚) → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ (𝑛 ∩ 𝑚))
31	28, 29, 30	mp2an 705	. . . . . 6 ⊢ ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ (𝑛 ∩ 𝑚)
32		simp33 1230	. . . . . 6 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → (𝑛 ∩ 𝑚) = ∅)
33	31, 32	sseqtrid 3955	. . . . 5 ⊢ (((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) ∧ (𝑛 ∈ 𝐽 ∧ 𝑚 ∈ 𝐽) ∧ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ((𝑛 ∩ 𝑍) ∩ (𝑚 ∩ 𝑍)) ⊆ ∅)
34		ss0 4355	. . . . 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 50384	1 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) → ∃𝑙 ∈ (𝐽 ↾t 𝑍)∃𝑘 ∈ (𝐽 ↾t 𝑍)(𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  ∪ cuni 4872  ‘cfv 6566  (class class class)co 7451   ↾_t crest 17641  Topctop 23266  Clsdccld 23389

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-en 9012  df-fin 9015  df-fi 9440  df-rest 17643  df-topgen 17664  df-top 23267  df-topon 23284  df-bases 23319  df-cld 23392

This theorem is used by:  iscnrm3l  50396