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

Theorem isnrm 23383
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 6862 . . . . 5 (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽))
21ineq1d 4169 . . . 4 (𝑗 = 𝐽 → ((Clsd‘𝑗) ∩ 𝒫 𝑥) = ((Clsd‘𝐽) ∩ 𝒫 𝑥))
3 fveq2 6862 . . . . . . . 8 (𝑗 = 𝐽 → (cls‘𝑗) = (cls‘𝐽))
43fveq1d 6864 . . . . . . 7 (𝑗 = 𝐽 → ((cls‘𝑗)‘𝑧) = ((cls‘𝐽)‘𝑧))
54sseq1d 3965 . . . . . 6 (𝑗 = 𝐽 → (((cls‘𝑗)‘𝑧) ⊆ 𝑥 ↔ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))
65anbi2d 639 . . . . 5 (𝑗 = 𝐽 → ((𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
76rexeqbi1dv 3330 . . . 4 (𝑗 = 𝐽 → (∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
82, 7raleqbidv 3335 . . 3 (𝑗 = 𝐽 → (∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
98raleqbi1dv 3329 . 2 (𝑗 = 𝐽 → (∀𝑥𝑗𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑥𝐽𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
10 df-nrm 23365 . 2 Nrm = {𝑗 ∈ Top ∣ ∀𝑥𝑗𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥)}
119, 10elrab2 3652 1 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 399   = wceq 1559  wcel 2141  wral 3075  wrex 3085  cin 3901  wss 3902  𝒫 cpw 4552  cfv 6516  Topctop 22941  Clsdccld 23064  clsccl 23066  Nrmcnrm 23358
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-iota 6472  df-fv 6524  df-nrm 23365
This theorem is referenced by:  nrmtop  23384  nrmsep3  23403  isnrm2  23406  kqnrmlem1  23791  kqnrmlem2  23792  nrmhmph  23842
  Copyright terms: Public domain W3C validator