| 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 6878 | . . . . 5 ⊢ (𝑗 = 𝐽 → (Clsd‘𝑗) = (Clsd‘𝐽)) | |
| 2 | 1 | ineq1d 4165 | . . . 4 ⊢ (𝑗 = 𝐽 → ((Clsd‘𝑗) ∩ 𝒫 𝑥) = ((Clsd‘𝐽) ∩ 𝒫 𝑥)) |
| 3 | fveq2 6878 | . . . . . . . 8 ⊢ (𝑗 = 𝐽 → (cls‘𝑗) = (cls‘𝐽)) | |
| 4 | 3 | fveq1d 6880 | . . . . . . 7 ⊢ (𝑗 = 𝐽 → ((cls‘𝑗)‘𝑧) = ((cls‘𝐽)‘𝑧)) |
| 5 | 4 | sseq1d 3962 | . . . . . 6 ⊢ (𝑗 = 𝐽 → (((cls‘𝑗)‘𝑧) ⊆ 𝑥 ↔ ((cls‘𝐽)‘𝑧) ⊆ 𝑥)) |
| 6 | 5 | anbi2d 642 | . . . . 5 ⊢ (𝑗 = 𝐽 → ((𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 7 | 6 | rexeqbi1dv 3330 | . . . 4 ⊢ (𝑗 = 𝐽 → (∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 8 | 2, 7 | raleqbidv 3334 | . . 3 ⊢ (𝑗 = 𝐽 → (∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 9 | 8 | raleqbi1dv 3329 | . 2 ⊢ (𝑗 = 𝐽 → (∀𝑥 ∈ 𝑗 ∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥) ↔ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| 10 | df-nrm 23542 | . 2 ⊢ Nrm = {𝑗 ∈ Top ∣ ∀𝑥 ∈ 𝑗 ∀𝑦 ∈ ((Clsd‘𝑗) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝑗 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝑗)‘𝑧) ⊆ 𝑥)} | |
| 11 | 9, 10 | elrab2 3649 | 1 ⊢ (𝐽 ∈ Nrm ↔ (𝐽 ∈ Top ∧ ∀𝑥 ∈ 𝐽 ∀𝑦 ∈ ((Clsd‘𝐽) ∩ 𝒫 𝑥)∃𝑧 ∈ 𝐽 (𝑦 ⊆ 𝑧 ∧ ((cls‘𝐽)‘𝑧) ⊆ 𝑥))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3076 ∃wrex 3086 ∩ cin 3898 ⊆ wss 3899 𝒫 cpw 4557 ‘cfv 6533 Topctop 23118 Clsdccld 23241 clsccl 23243 Nrmcnrm 23535 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| 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-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-iota 6489 df-fv 6541 df-nrm 23542 |
| This theorem is used by: nrmtop 23561 nrmsep3 23580 isnrm2 23583 kqnrmlem1 23969 kqnrmlem2 23970 nrmhmph 24020 |
| Copyright terms: Public domain | W3C validator |