| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ist1 | Structured version Visualization version GIF version | ||
| Description: The predicate "is a T1 space". (Contributed by FL, 18-Jun-2007.) |
| Ref | Expression |
|---|---|
| ist0.1 | ⊢ 𝑋 = ∪ 𝐽 |
| Ref | Expression |
|---|---|
| ist1 | ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | unieq 4884 | . . . 4 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽) | |
| 2 | ist0.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | 1, 2 | eqtr4di 2822 | . . 3 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = 𝑋) |
| 4 | fveq2 6879 | . . . 4 ⊢ (𝑥 = 𝐽 → (Clsd‘𝑥) = (Clsd‘𝐽)) | |
| 5 | 4 | eleq2d 2855 | . . 3 ⊢ (𝑥 = 𝐽 → ({𝑎} ∈ (Clsd‘𝑥) ↔ {𝑎} ∈ (Clsd‘𝐽))) |
| 6 | 3, 5 | raleqbidv 3345 | . 2 ⊢ (𝑥 = 𝐽 → (∀𝑎 ∈ ∪ 𝑥{𝑎} ∈ (Clsd‘𝑥) ↔ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| 7 | df-t1 23436 | . 2 ⊢ Fre = {𝑥 ∈ Top ∣ ∀𝑎 ∈ ∪ 𝑥{𝑎} ∈ (Clsd‘𝑥)} | |
| 8 | 6, 7 | elrab2 3663 | 1 ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ∀wral 3085 {csn 4591 ∪ cuni 4873 ‘cfv 6533 Topctop 23015 Clsdccld 23138 Frect1 23429 |
| 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-rab 3424 df-v 3465 df-dif 3916 df-un 3918 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 6489 df-fv 6541 df-t1 23436 |
| This theorem is referenced by: t1sncld 23448 t1ficld 23449 t1top 23452 ist1-2 23469 cnt1 23472 ordtt1 23501 qtopt1 34166 zarmxt1 34211 onint1 36845 |
| Copyright terms: Public domain | W3C validator |