MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nrmsep2 Structured version   Visualization version   GIF version

Theorem nrmsep2 23729
Description: In a normal space, any two disjoint closed sets have the property that each one is a subset of an open set whose closure is disjoint from the other. (Contributed by Jeff Hankins, 1-Feb-2010.) (Revised by Mario Carneiro, 24-Aug-2015.)
Assertion
Ref Expression
nrmsep2 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝐷) = ∅))
Distinct variable groups:   𝑥,𝐶   𝑥,𝐷   𝑥,𝐽

Proof of Theorem nrmsep2
StepHypRef Expression
1 simpl 488 . . 3 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → 𝐽 ∈ Nrm)
2 simpr2 1214 . . . 4 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → 𝐷 ∈ (Clsd‘𝐽))
3 eqid 2763 . . . . 5 ∪ 𝐽 = ∪ 𝐽
43cldopn 23404 . . . 4 (𝐷 ∈ (Clsd‘𝐽) → (∪ 𝐽 ∖ 𝐷) ∈ 𝐽)
52, 4syl 18 . . 3 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → (∪ 𝐽 ∖ 𝐷) ∈ 𝐽)
6 simpr1 1213 . . 3 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → 𝐶 ∈ (Clsd‘𝐽))
7 simpr3 1215 . . . 4 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → (𝐶 ∩ 𝐷) = ∅)
83cldss 23402 . . . . 5 (𝐶 ∈ (Clsd‘𝐽) → 𝐶 ⊆ ∪ 𝐽)
9 reldisj 4409 . . . . 5 (𝐶 ⊆ ∪ 𝐽 → ((𝐶 ∩ 𝐷) = ∅ ↔ 𝐶 ⊆ (∪ 𝐽 ∖ 𝐷)))
106, 8, 93syl 19 . . . 4 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → ((𝐶 ∩ 𝐷) = ∅ ↔ 𝐶 ⊆ (∪ 𝐽 ∖ 𝐷)))
117, 10mpbid 235 . . 3 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → 𝐶 ⊆ (∪ 𝐽 ∖ 𝐷))
12 nrmsep3 23728 . . 3 ((𝐽 ∈ Nrm ∧ ((∪ 𝐽 ∖ 𝐷) ∈ 𝐽 ∧ 𝐶 ∈ (Clsd‘𝐽) ∧ 𝐶 ⊆ (∪ 𝐽 ∖ 𝐷))) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ (∪ 𝐽 ∖ 𝐷)))
131, 5, 6, 11, 12syl13anc 1400 . 2 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ (∪ 𝐽 ∖ 𝐷)))
14 ssdifin0 4444 . . . 4 (((cls‘𝐽)‘𝑥) ⊆ (∪ 𝐽 ∖ 𝐷) → (((cls‘𝐽)‘𝑥) ∩ 𝐷) = ∅)
1514anim2i 629 . . 3 ((𝐶 ⊆ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ (∪ 𝐽 ∖ 𝐷)) → (𝐶 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝐷) = ∅))
1615reximi 3104 . 2 (∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ ((cls‘𝐽)‘𝑥) ⊆ (∪ 𝐽 ∖ 𝐷)) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝐷) = ∅))
1713, 16syl 18 1 ((𝐽 ∈ Nrm ∧ (𝐶 ∈ (Clsd‘𝐽) ∧ 𝐷 ∈ (Clsd‘𝐽) ∧ (𝐶 ∩ 𝐷) = ∅)) → ∃𝑥 ∈ 𝐽 (𝐶 ⊆ 𝑥 ∧ (((cls‘𝐽)‘𝑥) ∩ 𝐷) = ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  ∪ cuni 4872  ‘cfv 6566  Clsdccld 23389  clsccl 23391  Nrmcnrm 23683
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-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-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-rab 3417  df-v 3456  df-ss 3901  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-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574  df-top 23267  df-cld 23392  df-nrm 23690
This theorem is used by:  nrmsep  23730  isnrm2  23731
  Copyright terms: Public domain W3C validator