Theorem iscnrm3l 50028

Description: Lemma for iscnrm3 50029. Given a topology 𝐽, if two separated sets can be separated by open neighborhoods, then all subspaces of the topology 𝐽 are normal, i.e., two disjoint closed sets can be separated by open neighborhoods. (Contributed by Zhi Wang, 5-Sep-2024.)

Assertion

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

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

Allowed substitution hints:   𝑍(𝑡, 𝑠)

Proof of Theorem iscnrm3l

Step	Hyp	Ref	Expression
1		simpl 488	. . . . 5 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → 𝑠 = 𝐶)
2		simpr 490	. . . . . 6 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → 𝑡 = 𝐷)
3	2	fveq2d 6887	. . . . 5 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → ((cls‘𝐽)‘𝑡) = ((cls‘𝐽)‘𝐷))
4	1, 3	ineq12d 4167	. . . 4 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → (𝑠 ∩ ((cls‘𝐽)‘𝑡)) = (𝐶 ∩ ((cls‘𝐽)‘𝐷)))
5	4	eqeq1d 2763	. . 3 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → ((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ↔ (𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅))
6	1	fveq2d 6887	. . . . 5 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → ((cls‘𝐽)‘𝑠) = ((cls‘𝐽)‘𝐶))
7	6, 2	ineq12d 4167	. . . 4 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → (((cls‘𝐽)‘𝑠) ∩ 𝑡) = (((cls‘𝐽)‘𝐶) ∩ 𝐷))
8	7	eqeq1d 2763	. . 3 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → ((((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅ ↔ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
9	5, 8	anbi12d 644	. 2 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → (((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) ↔ ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅)))
10	1	sseq1d 3962	. . . 4 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → (𝑠 ⊆ 𝑛 ↔ 𝐶 ⊆ 𝑛))
11	2	sseq1d 3962	. . . 4 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → (𝑡 ⊆ 𝑚 ↔ 𝐷 ⊆ 𝑚))
12	10, 11	3anbi12d 1465	. . 3 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → ((𝑠 ⊆ 𝑛 ∧ 𝑡 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) ↔ (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))
13	12	2rexbidv 3228	. 2 ⊢ ((𝑠 = 𝐶 ∧ 𝑡 = 𝐷) → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑠 ⊆ 𝑛 ∧ 𝑡 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) ↔ ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)))
14		iscnrm3llem1 50026	. 2 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (𝐶 ∈ 𝒫 ∪ 𝐽 ∧ 𝐷 ∈ 𝒫 ∪ 𝐽))
15		simp1 1154	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → 𝐽 ∈ Top)
16		eqidd 2762	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → ∪ 𝐽 = ∪ 𝐽)
17		simp21 1225	. . . . 5 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → 𝑍 ∈ 𝒫 ∪ 𝐽)
18	17	elpwid 4566	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → 𝑍 ⊆ ∪ 𝐽)
19		eqidd 2762	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (𝐽 ↾t 𝑍) = (𝐽 ↾t 𝑍))
20		simp22 1226	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)))
21		simp3 1156	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (𝐶 ∩ 𝐷) = ∅)
22		simp23 1227	. . . 4 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍)))
23	15, 16, 18, 19, 20, 21, 22	restclssep 49993	. . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
24		iscnrm3llem2 50027	. . 3 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → (∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅) → ∃𝑙 ∈ (𝐽 ↾t 𝑍)∃𝑘 ∈ (𝐽 ↾t 𝑍)(𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅)))
25	23, 24	embantd 60	. 2 ⊢ ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) ∧ (𝐶 ∩ 𝐷) = ∅) → ((((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅) → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝐶 ⊆ 𝑛 ∧ 𝐷 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ∃𝑙 ∈ (𝐽 ↾t 𝑍)∃𝑘 ∈ (𝐽 ↾t 𝑍)(𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅)))
26	9, 13, 14, 25	iscnrm3lem5 50014	1 ⊢ (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 ∪ 𝐽∀𝑡 ∈ 𝒫 ∪ 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛 ∈ 𝐽 ∃𝑚 ∈ 𝐽 (𝑠 ⊆ 𝑛 ∧ 𝑡 ⊆ 𝑚 ∧ (𝑛 ∩ 𝑚) = ∅)) → ((𝑍 ∈ 𝒫 ∪ 𝐽 ∧ 𝐶 ∈ (Clsd‘(𝐽 ↾t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽 ↾t 𝑍))) → ((𝐶 ∩ 𝐷) = ∅ → ∃𝑙 ∈ (𝐽 ↾t 𝑍)∃𝑘 ∈ (𝐽 ↾t 𝑍)(𝐶 ⊆ 𝑙 ∧ 𝐷 ⊆ 𝑘 ∧ (𝑙 ∩ 𝑘) = ∅)))))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  ∪ cuni 4867  ‘cfv 6537  (class class class)co 7418   ↾_t crest 17584  Topctop 23204  Clsdccld 23327  clsccl 23329

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 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  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-iin 4954  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-en 8967  df-fin 8970  df-fi 9396  df-rest 17586  df-topgen 17607  df-top 23205  df-topon 23222  df-bases 23257  df-cld 23330  df-cls 23332

This theorem is used by:  iscnrm3  50029