| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isnrm | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| isnrm | ⊢ (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fveq2 6842 | . . . . 5 ⊢ (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽)) | |
| 2 | 1 | ineq1d 4173 | . . . 4 ⊢ (𝑗 = 𝐽 → ((Clsd‘𝑗) ∩ 𝒫 𝑥) = ((Clsd‘𝐽) ∩ 𝒫 𝑥)) |
| 3 | fveq2 6842 | . . . . . . . 8 ⊢ (𝑗 = 𝐽 → (cls‘𝑗) = (cls‘𝐽)) | |
| 4 | 3 | fveq1d 6844 | . . . . . . 7 ⊢ (𝑗 = 𝐽 → ((cls‘𝑗)‘𝑧) = ((cls‘𝐽)‘𝑧)) |
| 5 | 4 | sseq1d 3967 | . . . . . 6 ⊢ (𝑗 = 𝐽 → (((cls‘𝑗)‘𝑧) ⊆ 𝑥 ↔ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)) |
| 6 | 5 | anbi2d 631 | . . . . 5 ⊢ (𝑗 = 𝐽 → ((𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 7 | 6 | rexeqbi1dv 3311 | . . . 4 ⊢ (𝑗 = 𝐽 → (∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 8 | 2, 7 | raleqbidv 3318 | . . 3 ⊢ (𝑗 = 𝐽 → (∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 9 | 8 | raleqbi1dv 3310 | . 2 ⊢ (𝑗 = 𝐽 → (∀𝑥 ∈ 𝑗 ∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 10 | df-nrm 23273 | . 2 ⊢ Nrm = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥)} | |
| 11 | 9, 10 | elrab2 3651 | 1 ⊢ (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 ∩ cin 3902 ⊆ wss 3903 𝒫 cpw 4556 ‘cfv 6500 Topctop 22849 Clsdccld 22972 clsccl 22974 Nrmcnrm 23266 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-iota 6456 df-fv 6508 df-nrm 23273 |
| This theorem is referenced by: nrmtop 23292 nrmsep3 23311 isnrm2 23314 kqnrmlem1 23699 kqnrmlem2 23700 nrmhmph 23750 |
| Copyright terms: Public domain | W3C validator |