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

Theorem isnrm 23457
Description: The predicate "is a normal space." Much like the case for regular spaces, normal does not imply Hausdorff or even regular. (Contributed by Jeff Hankins, 1-Feb-2010.) (Revised by Mario Carneiro, 24-Aug-2015.)
Assertion
Ref Expression
isnrm (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
Distinct variable group:   𝑥,𝑦,𝑧,𝐽

Proof of Theorem isnrm
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6879 . . . . 5 (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽))
21ineq1d 4180 . . . 4 (𝑗 = 𝐽 → ((Clsd‘𝑗) ∩ 𝒫 𝑥) = ((Clsd‘𝐽) ∩ 𝒫 𝑥))
3 fveq2 6879 . . . . . . . 8 (𝑗 = 𝐽 → (cls‘𝑗) = (cls‘𝐽))
43fveq1d 6881 . . . . . . 7 (𝑗 = 𝐽 → ((cls‘𝑗)‘𝑧) = ((cls‘𝐽)‘𝑧))
54sseq1d 3976 . . . . . 6 (𝑗 = 𝐽 → (((cls‘𝑗)‘𝑧) ⊆ 𝑥 ↔ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))
65anbi2d 641 . . . . 5 (𝑗 = 𝐽 → ((𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
76rexeqbi1dv 3340 . . . 4 (𝑗 = 𝐽 → (∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
82, 7raleqbidv 3345 . . 3 (𝑗 = 𝐽 → (∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
98raleqbi1dv 3339 . 2 (𝑗 = 𝐽 → (∀𝑥𝑗𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑥𝐽𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
10 df-nrm 23439 . 2 Nrm = {𝑗 ∈ Top ∣ ∀𝑥𝑗𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥)}
119, 10elrab2 3663 1 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1567  wcel 2149  wral 3085  wrex 3095  cin 3912  wss 3913  𝒫 cpw 4564  cfv 6534  Topctop 23015  Clsdccld 23138  clsccl 23140  Nrmcnrm 23432
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-iota 6490  df-fv 6542  df-nrm 23439
This theorem is referenced by:  nrmtop  23458  nrmsep3  23477  isnrm2  23480  kqnrmlem1  23865  kqnrmlem2  23866  nrmhmph  23916
  Copyright terms: Public domain W3C validator