| 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 4885 | . . . 4 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = ∪ 𝐽) | |
| 2 | ist0.1 | . . . 4 ⊢ 𝑋 = ∪ 𝐽 | |
| 3 | 1, 2 | eqtr4di 2818 | . . 3 ⊢ (𝑥 = 𝐽 → ∪ 𝑥 = 𝑋) |
| 4 | fveq2 6885 | . . . 4 ⊢ (𝑥 = 𝐽 → (Clsd‘𝑥) = (Clsd‘𝐽)) | |
| 5 | 4 | eleq2d 2851 | . . 3 ⊢ (𝑥 = 𝐽 → ({𝑎} ∈ (Clsd‘𝑥) ↔ {𝑎} ∈ (Clsd‘𝐽))) |
| 6 | 3, 5 | raleqbidv 3340 | . 2 ⊢ (𝑥 = 𝐽 → (∀𝑎 ∈ ∪ 𝑥{𝑎} ∈ (Clsd‘𝑥) ↔ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| 7 | df-t1 23500 | . 2 ⊢ Fre = {𝑥 ∈ Top ∣ ∀𝑎 ∈ ∪ 𝑥{𝑎} ∈ (Clsd‘𝑥)} | |
| 8 | 6, 7 | elrab2 3656 | 1 ⊢ (𝐽 ∈ Fre ↔ (𝐽 ∈ Top ∧ ∀𝑎 ∈ 𝑋 {𝑎} ∈ (Clsd‘𝐽))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∀wral 3081 {csn 4591 ∪ cuni 4874 ‘cfv 6540 Topctop 23079 Clsdccld 23202 Frect1 23493 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| 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 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-iota 6496 df-fv 6548 df-t1 23500 |
| This theorem is used by: t1sncld 23512 t1ficld 23513 t1top 23516 ist1-2 23533 cnt1 23536 ordtt1 23565 qtopt1 34248 zarmxt1 34293 onint1 36993 |
| Copyright terms: Public domain | W3C validator |