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

Theorem isnrm 23279
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 6834 . . . . 5 (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽))
21ineq1d 4171 . . . 4 (𝑗 = 𝐽 → ((Clsd‘𝑗) ∩ 𝒫 𝑥) = ((Clsd‘𝐽) ∩ 𝒫 𝑥))
3 fveq2 6834 . . . . . . . 8 (𝑗 = 𝐽 → (cls‘𝑗) = (cls‘𝐽))
43fveq1d 6836 . . . . . . 7 (𝑗 = 𝐽 → ((cls‘𝑗)‘𝑧) = ((cls‘𝐽)‘𝑧))
54sseq1d 3965 . . . . . 6 (𝑗 = 𝐽 → (((cls‘𝑗)‘𝑧) ⊆ 𝑥 ↔ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))
65anbi2d 630 . . . . 5 (𝑗 = 𝐽 → ((𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
76rexeqbi1dv 3309 . . . 4 (𝑗 = 𝐽 → (∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
82, 7raleqbidv 3316 . . 3 (𝑗 = 𝐽 → (∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
98raleqbi1dv 3308 . 2 (𝑗 = 𝐽 → (∀𝑥𝑗𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑥𝐽𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
10 df-nrm 23261 . 2 Nrm = {𝑗 ∈ Top ∣ ∀𝑥𝑗𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧𝑗 (𝑦𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥)}
119, 10elrab2 3649 1 (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥𝐽𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧𝐽 (𝑦𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3051  wrex 3060  cin 3900  wss 3901  𝒫 cpw 4554  cfv 6492  Topctop 22837  Clsdccld 22960  clsccl 22962  Nrmcnrm 23254
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-iota 6448  df-fv 6500  df-nrm 23261
This theorem is referenced by:  nrmtop  23280  nrmsep3  23299  isnrm2  23302  kqnrmlem1  23687  kqnrmlem2  23688  nrmhmph  23738
  Copyright terms: Public domain W3C validator