Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  iscnrm3l Structured version   Visualization version   GIF version

Theorem iscnrm3l 48669
Description: Lemma for iscnrm3 48670. 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
StepHypRef Expression
1 simpl 482 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → 𝑠 = 𝐶)
2 simpr 484 . . . . . 6 ((𝑠 = 𝐶𝑡 = 𝐷) → 𝑡 = 𝐷)
32fveq2d 6905 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → ((cls‘𝐽)‘𝑡) = ((cls‘𝐽)‘𝐷))
41, 3ineq12d 4229 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑠 ∩ ((cls‘𝐽)‘𝑡)) = (𝐶 ∩ ((cls‘𝐽)‘𝐷)))
54eqeq1d 2735 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ↔ (𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅))
61fveq2d 6905 . . . . 5 ((𝑠 = 𝐶𝑡 = 𝐷) → ((cls‘𝐽)‘𝑠) = ((cls‘𝐽)‘𝐶))
76, 2ineq12d 4229 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (((cls‘𝐽)‘𝑠) ∩ 𝑡) = (((cls‘𝐽)‘𝐶) ∩ 𝐷))
87eqeq1d 2735 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅ ↔ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
95, 8anbi12d 631 . 2 ((𝑠 = 𝐶𝑡 = 𝐷) → (((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) ↔ ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅)))
101sseq1d 4027 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑠𝑛𝐶𝑛))
112sseq1d 4027 . . . 4 ((𝑠 = 𝐶𝑡 = 𝐷) → (𝑡𝑚𝐷𝑚))
1210, 113anbi12d 1435 . . 3 ((𝑠 = 𝐶𝑡 = 𝐷) → ((𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅) ↔ (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)))
13122rexbidv 3218 . 2 ((𝑠 = 𝐶𝑡 = 𝐷) → (∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅) ↔ ∃𝑛𝐽𝑚𝐽 (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)))
14 iscnrm3llem1 48667 . 2 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐶 ∈ 𝒫 𝐽𝐷 ∈ 𝒫 𝐽))
15 simp1 1134 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐽 ∈ Top)
16 eqidd 2734 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐽 = 𝐽)
17 simp21 1204 . . . . 5 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝑍 ∈ 𝒫 𝐽)
1817elpwid 4613 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝑍 𝐽)
19 eqidd 2734 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐽t 𝑍) = (𝐽t 𝑍))
20 simp22 1205 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐶 ∈ (Clsd‘(𝐽t 𝑍)))
21 simp3 1136 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (𝐶𝐷) = ∅)
22 simp23 1206 . . . 4 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → 𝐷 ∈ (Clsd‘(𝐽t 𝑍)))
2315, 16, 18, 19, 20, 21, 22restclssep 48633 . . 3 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → ((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅))
24 iscnrm3llem2 48668 . . 3 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → (∃𝑛𝐽𝑚𝐽 (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅) → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))
2523, 24embantd 59 . 2 ((𝐽 ∈ Top ∧ (𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) ∧ (𝐶𝐷) = ∅) → ((((𝐶 ∩ ((cls‘𝐽)‘𝐷)) = ∅ ∧ (((cls‘𝐽)‘𝐶) ∩ 𝐷) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝐶𝑛𝐷𝑚 ∧ (𝑛𝑚) = ∅)) → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))
269, 13, 14, 25iscnrm3lem5 48655 1 (𝐽 ∈ Top → (∀𝑠 ∈ 𝒫 𝐽𝑡 ∈ 𝒫 𝐽(((𝑠 ∩ ((cls‘𝐽)‘𝑡)) = ∅ ∧ (((cls‘𝐽)‘𝑠) ∩ 𝑡) = ∅) → ∃𝑛𝐽𝑚𝐽 (𝑠𝑛𝑡𝑚 ∧ (𝑛𝑚) = ∅)) → ((𝑍 ∈ 𝒫 𝐽𝐶 ∈ (Clsd‘(𝐽t 𝑍)) ∧ 𝐷 ∈ (Clsd‘(𝐽t 𝑍))) → ((𝐶𝐷) = ∅ → ∃𝑙 ∈ (𝐽t 𝑍)∃𝑘 ∈ (𝐽t 𝑍)(𝐶𝑙𝐷𝑘 ∧ (𝑙𝑘) = ∅)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1085   = wceq 1535  wcel 2104  wral 3057  wrex 3066  cin 3962  wss 3963  c0 4339  𝒫 cpw 4604   cuni 4914  cfv 6558  (class class class)co 7425  t crest 17456  Topctop 22896  Clsdccld 23021  clsccl 23023
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1963  ax-7 2003  ax-8 2106  ax-9 2114  ax-10 2137  ax-11 2153  ax-12 2173  ax-ext 2704  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5366  ax-pr 5430  ax-un 7747
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1538  df-fal 1548  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2536  df-eu 2565  df-clab 2711  df-cleq 2725  df-clel 2812  df-nfc 2888  df-ne 2937  df-ral 3058  df-rex 3067  df-reu 3377  df-rab 3433  df-v 3479  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4915  df-int 4954  df-iun 5000  df-iin 5001  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5635  df-we 5637  df-xp 5689  df-rel 5690  df-cnv 5691  df-co 5692  df-dm 5693  df-rn 5694  df-res 5695  df-ima 5696  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6510  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7428  df-oprab 7429  df-mpo 7430  df-om 7881  df-1st 8007  df-2nd 8008  df-en 8979  df-fin 8982  df-fi 9442  df-rest 17458  df-topgen 17479  df-top 22897  df-topon 22914  df-bases 22950  df-cld 23024  df-cls 23026
This theorem is referenced by:  iscnrm3  48670
  Copyright terms: Public domain W3C validator